Hello,(adsbygoogle = window.adsbygoogle || []).push({});

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:

ninteger numbers are given. Show that there are at least two numbers among them whose difference is multiple ofn-1.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A pigeonhole problem

**Physics Forums | Science Articles, Homework Help, Discussion**