The Thinking Board

Two integers that differ by a multiple of n

The room

Not for the board · 0 of 5

The problem

Show that among any integers there are two whose difference is divisible by .

The whole proof is one idea. It is the same idea behind a thousand other arguments, which is why it is worth meeting here, where it is easy to see.

0 proofs posted

0 votes cast
Most convincingNewest

No proofs yet

Be the first to put an argument on the board.

Add a proof