Question

Prove that among five integers, it is possible to choose two whose difference is divisible by `4`.

Difficulty level (1 very easy - 10 very hard): 3

Number Theory -> Modular Arithmetic / Remainder Arithmetic Combinatorics -> Pigeonhole Principle Number Theory -> Division -> Parity (Even/Odd) Arithmetic -> Division with Remainder

There are no comments yet.

Authentication required

You must log in to post a comment.