The question is easy.
My proof: If say some of the numbers is divisible by n then we are done. If no then there must be two numbers which must be congruent to the same number x(mod n). Let those two numbers be (2^i-1) and (2^j-1). Then subtract the smaller from the larger and factorize. WLOG let i>j. Then u get 2^j common outside and inside the bracket u get (2^(i-j)-1). Now since n is odd, gcd(n,2^j)=1. So n divides (2^(i-j)-1) and note that this quantity lies in the set and hence you are done :)

Sorry for not using Latex as I am in a hurry right now !

$</code> ... <code>$</code>...<code>."> Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in $</span> ... <span>$ or $</span> ... <span>$ to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestThe question is easy. My proof: If say some of the numbers is divisible by n then we are done. If no then there must be two numbers which must be congruent to the same number x(mod n). Let those two numbers be (2^i-1) and (2^j-1). Then subtract the smaller from the larger and factorize. WLOG let i>j. Then u get 2^j common outside and inside the bracket u get (2^(i-j)-1). Now since n is odd, gcd(n,2^j)=1. So n divides (2^(i-j)-1) and note that this quantity lies in the set and hence you are done :)

Sorry for not using Latex as I am in a hurry right now !

Log in to reply

That is a nice solution and no problem!

Log in to reply

If I can ask,are you a RMO participant?

Log in to reply

Yes

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Log in to reply

Seems like I have got a tough competitor from my state ;)

Log in to reply