Show that ## 11\mid R_{n} ## if and only if ## n ## is even

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    even
AI Thread Summary
The discussion centers on proving that a repunit \( R_n \) is divisible by 11 if and only if \( n \) is even. The proof begins by expressing \( R_n \) in terms of its digits and calculating an alternating sum \( T \), concluding that if \( 11 \mid R_n \), then \( T = 0 \), which implies \( n \) must be even. Conversely, if \( n \) is even, the alternating sum also equals zero, confirming that \( 11 \mid R_n \). The conversation also highlights the need for clarity in the proof and suggests including a link to the divisibility criterion for better understanding. Overall, the conclusion is that the divisibility of \( R_n \) by 11 is directly linked to the evenness of \( n \).
Math100
Messages
813
Reaction score
229
Homework Statement
Given a repunit ## R_{n} ##, show that ## 11\mid R_{n} ## if and only if ## n ## is even.
Relevant Equations
None.
Proof:

Suppose ## 11\mid R_{n} ##, given a repunit ## R_{n} ##.
Let ## R_{n}=1\cdot 10^{m}+\dotsb +1\cdot 10+1 ## and ## T=(a_{0}-a_{1})+(a_{2}-a_{3})+\dotsb +(-1)^{m}a_{m} ##.
Then ## T=(1-1)+(1-1)+\dotsb +(-1)^{m}a_{m}=0 ##.
This means ## 11\mid R_{n}\implies T=0 ##.
Thus, ## n ## is even.
Conversely, suppose ## n ## is even.
Then ## 1-1+1-1+\dotsb -1+1=0 ## and ## 11\mid 0 ##.
Thus ## 11\mid R_{n} ##.
Therefore, ## 11\mid R_{n} ## if and only if ## n ## is even.
 
Physics news on Phys.org
Math100 said:
Homework Statement:: Given a repunit ## R_{n} ##, show that ## 11\mid R_{n} ## if and only if ## n ## is even.
Relevant Equations:: None.

Proof:

Suppose ## 11\mid R_{n} ##, given a repunit ## R_{n} ##.
Let ## R_{n}=1\cdot 10^{m}+\dotsb +1\cdot 10+1 ## and ## T=(a_{0}-a_{1})+(a_{2}-a_{3})+\dotsb +(-1)^{m}a_{m} ##.
Then ## T=(1-1)+(1-1)+\dotsb +(-1)^{m}a_{m}=0 ##.
This means ## 11\mid R_{n}\implies T=0 ##.
Thus, ## n ## is even.
Conversely, suppose ## n ## is even.
Then ## 1-1+1-1+\dotsb -1+1=0 ## and ## 11\mid 0 ##.
Thus ## 11\mid R_{n} ##.
Therefore, ## 11\mid R_{n} ## if and only if ## n ## is even.
The first part is a bit clumsy and a link to the thread with that criterion that you use would have been nice, meaning: I couldn't find it.

I would write the first part as:

Suppose ## 11\mid R_{m} ##, given a repunit ## R_{m} ##.
Let ## R_{m}=1\cdot 10^{m}+\dotsb +1\cdot 10+1 ## and ## T=(a_{0}-a_{1})+(a_{2}-a_{3})+\dotsb +(-1)^{m}a_{m} ##.
Then (insert link) ##T=0## and ##m## has to be even.

The second part is also shown in
https://www.physicsforums.com/threa...-number-of-digits-is-divisible-by-11.1017287/
 
fresh_42 said:
The first part is a bit clumsy and a link to the thread with that criterion that you use would have been nice, meaning: I couldn't find it.

I would write the first part as:

Suppose ## 11\mid R_{m} ##, given a repunit ## R_{m} ##.
Let ## R_{m}=1\cdot 10^{m}+\dotsb +1\cdot 10+1 ## and ## T=(a_{0}-a_{1})+(a_{2}-a_{3})+\dotsb +(-1)^{m}a_{m} ##.
Then (insert link) ##T=0## and ##m## has to be even.

The second part is also shown in
https://www.physicsforums.com/threa...-number-of-digits-is-divisible-by-11.1017287/
But what specifically, should I insert in the first part of the proof, where "Then (insert link) ## T=0 ##..."?
 
Math100 said:
But what specifically, should I insert in the first part of the proof, where "Then (insert link) ## T=0 ##..."?
Sorry, my fault. You just use the divisibility by 11 criterion. I thought it was an earlier thread. I haven't had it in mind. So maybe a reminder for people like me would be nice: A number is divisible by 11 if and only if its alternating sum of digits is.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top