×

# Divisibility example.

If $$d|n$$ then prove that $${ 2 }^{ d }-1|{ 2 }^{ n }-1$$.

This is my solution

If $$d|n$$ then $$n=dk$$ for some $$k$$.Then we have to prove $${ 2 }^{ d }-1|{ 2 }^{ dn }-1$$ or $${ 2 }^{ d }-1|{ ({ 2 }^{ d }) }^{ k }-1$$.Now let $$x={ 2 }^{ d }$$ therefore we have to prove $$x-1|{ x }^{ k }-1$$ which is true by Remainder theorem.

Note by Shivamani Patil
1 year, 10 months ago

## Comments

Sort by:

Top Newest

NICE but too EASY. · 1 year, 10 months ago

Log in to reply

Math is neither easy nor difficult for her lover.@Krishna Ar · 1 year, 10 months ago

Log in to reply

haha · 1 year, 10 months ago

Log in to reply

Your proof is awesome. · 1 year, 10 months ago

Log in to reply

Thanx.@Adarsh Kumar · 1 year, 10 months ago

Log in to reply

nice.... · 1 year, 10 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...