anonymous
  • anonymous
Prove that for any integer n, at least one of the integers n, n+2, n+4 is divisible by 3 .
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
I don't recall how to organize a proof of this type. But you might take it one case at a time... If n is divisible by 3, then you're done. If n is not divisible by 3, then it must either be 1 greater or 2 greater than a number that is divisible by 3 (i.e., if it was 3 greater than a number divisible by 3, it would also be divisible by 3). If n is one greater, then n + 2 is three greater than the number divisible by 3, therefore n+2 is also divisible by 3. If n is two greater than a number divisible by 3, then n + 4 will make it 6 greater than that number, making n + 4 divisible by 3.
anonymous
  • anonymous
That's not a proof, but maybe you could use that logic to formalize in a proof format.
anonymous
  • anonymous
ok thks i'll try

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
you could use another variable to help. If n is not divisible by 3, then if m is divisible by 3, n must be m + 1 or m + 2.
anonymous
  • anonymous
so n + 2 = (m + 1) + 2 = m + 3... and since m is divisible by 3, so is m+3
anonymous
  • anonymous
is this make sense? n+(n+2)+(n+4) = 3n+6 , but (3n+6)/3 = n+2 is that sufficient proof?

Looking for something else?

Not the answer you are looking for? Search for more explanations.