English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

Prove or disprove using a counterexample that the sum of any three consecutive even integers is divisible by 6.

2007-04-02 18:31:10 · 6 answers · asked by tan 1 in Science & Mathematics Mathematics

6 answers

If the middle number is n, the others are n-2 and n + 2, so that their sum is S = n-2 + n + n+2 = 3n. But since n is even, n= 2n' for some integer n', and their sum S is given by S = 3 * 2n' = 6 n'. Therefore, S is divisible by 6.

2007-04-05 09:24:06 · answer #1 · answered by Steiner 7 · 0 0

If we call the first of the 3 integers 2N, then the second and third integers are 2N+2 and 2N+4.

The sum of the three integers is 2N + (2N+2) + (2N+4)
= 6N+6

6N+6 = 6(N+1) is obviosly divisible by 6...

2007-04-02 18:45:06 · answer #2 · answered by heartsensei 4 · 0 0

Why can't you use a counterexample? That's exactly how you would prove this false (which it is). Look, 5|(2+3), but 5 doesn't divide 2 or 3.

2016-03-28 23:23:50 · answer #3 · answered by Anonymous · 0 0

This is true.

Three consecutive even integers will have the form 2k, 2k + 2, 2k + 4, for some integer k.

If I add these together, I get 6k + 6, which is certainly divisible by 6.

2007-04-02 18:42:34 · answer #4 · answered by Anonymous · 1 0

-2, 0, 2

2007-04-02 19:06:36 · answer #5 · answered by David C 1 · 0 0

2x+2x+2+2x+4=6x+6
Please give me best answer thanks!

2007-04-03 06:28:29 · answer #6 · answered by Anonymous · 0 0

fedest.com, questions and answers