- #1
chem3
- 6
- 0
Hello,
I have this logic problem which I know should be solved by the pigeonhole principle but I was not successful in solving it after many tries and I hope someone here would help me out.
The problem says:
n integer numbers are given. Show that there are at least two numbers among them whose difference is multiple of n-1.
I have this logic problem which I know should be solved by the pigeonhole principle but I was not successful in solving it after many tries and I hope someone here would help me out.
The problem says:
n integer numbers are given. Show that there are at least two numbers among them whose difference is multiple of n-1.