SOLUTION: Prove that for any 8 natural numbers you can choose two of them so that their difference is divisible by 7.

SOLUTION: Prove that for any 8 natural numbers you can choose two of them so that their difference is divisible by 7.

Algebra.Com

Question 1026899: Prove that for any 8 natural numbers you can choose two of them so that their difference is divisible by 7.

Answer by richard1234(7193) (Show Source): You can put this solution on YOUR website!
By Pigeonhole principle, there are two natural numbers that leave the same remainder when divided by 7, so the difference between these two is divisible by 7.
RELATED QUESTIONS
Prove that n^8 − n^4 is divisible by 5 for any natural... (answered by robertb,ikleyn)

Prove that n^5 − n is divisible by 5 for any natural... (answered by richard1234)

1. What�s the smallest number that you can write with 1�s and 0�s which is divisible by... (answered by Edwin McCravy)

Prove that for any two numbers, the product of their sum and their difference is equal to (answered by Alan3354)

List the first 8 multiples of 14 to prove that the square of any even natural number is... (answered by CubeyThePenguin)

I am struggling with this question, can someone help? thanks so much. Select any odd... (answered by amine)

Please use formal mathematical induction to prove that given any 37 positive integers,... (answered by ikleyn)

Prove that given any set of $17$ integers, there exist nine of them whose sum is... (answered by mccravyedwin,Edwin McCravy,ikleyn)

Write an algebraic expression that proves the difference of the square of any two odd... (answered by Alan3354)