Never true
Depends on value of n
Always true

**
This section requires Javascript.
**

You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.

We employ the famous and useful "pigeon-hole principle": If there are more pigeons than holes, then some hole must contain at least two pigeons. There are only n numbers

modulo n, but the set {1,11, 111, 1111,... }, whose largest member has n+1 digits, has size n + 1; thus, it contains two numbers whose values are equal modulo n. Subtract one from the other!