Waste less time on Facebook — follow Brilliant.
×

PHP practice for RMO #1

Let \(n \geq 3\) be an odd number.Show that there is a number in the set,\(\{2^1-1,2^2-1,...2^{n-1}-1\}\),which is divisible by \(n\).

Note by Adarsh Kumar
10 months, 3 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

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 ! Shrihari B · 10 months ago

Log in to reply

@Shrihari B If I can ask,are you a RMO participant? Adarsh Kumar · 10 months ago

Log in to reply

@Adarsh Kumar Seems like I have got a tough competitor from my state ;) Nihar Mahajan · 10 months ago

Log in to reply

@Adarsh Kumar Yes Shrihari B · 10 months ago

Log in to reply

@Shrihari B This year? Adarsh Kumar · 10 months ago

Log in to reply

@Adarsh Kumar Yes Shrihari B · 10 months ago

Log in to reply

@Shrihari B Which class? Adarsh Kumar · 10 months ago

Log in to reply

@Adarsh Kumar This is my last year I am in 11th Shrihari B · 10 months ago

Log in to reply

@Shrihari B Ohh Well,best of luck! Adarsh Kumar · 10 months ago

Log in to reply

@Shrihari B That is a nice solution and no problem! Adarsh Kumar · 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...