MHB Discovering the Unit Digit of Rn: Solving for n = 0 to 5

  • Thread starter Thread starter veronica1999
  • Start date Start date
  • Tags Tags
    Unit
veronica1999
Messages
61
Reaction score
0
If Rn = 1/2(a^n + b^n) where a= 3+ 2root2 b= 3 - 2root2 and n= 0,1,2,3,4,5,...
then R12345 is an integer. Its units digit is..
I didn't have any ideas so I started to plug in numbers looking for a pattern.
I am sure this is not the right approach.

R0 = 1

R1 = 3

R2= 7

R3= 9

Could I get some help?
 
Last edited:
Physics news on Phys.org
veronica1999 said:
If Rn = 1/2(a^n + b^n) where a= 3+ 2root2 b= 3 - 2root2 and n= 0,1,2,3,4,5,...
then R12345 is an integer. Its units digit is..
I didn't have any ideas so I started to plug in numbers looking for a pattern.
I am sure this is not the right approach.

R0 = 1

R1 = 3

R2= 7

R3= 9

Could I get some help?

It is not difficult to find that the sequence is the solution of the difference equation...

$\displaystyle R_{n+2}= 6\ R_{n+1} - R_{n}$ (1)

... with the initial conditions $R_{0}=1$ and $R_{1}=3$. The first terms are...

$R_{0}=1\ ,\ R_{1}=3\ ,\ R_{2}= 17\ ,\ R_{3}=99\ ,\ R_{4}= 577\ ,\ R_{5}= 3363\ ,\ R_{6}= 21401\ ,\ ...$

... and that suggests that the last significant digit is periodic of period 6. Because is $12345 = 3\ \text {mod}\ 6$ the last significant digit of $R_{12345}$ should be 9...

Kind regards

$\chi$ $\sigma$
 
veronica1999 said:
If Rn = 1/2(a^n + b^n) where a= 3+ 2root2 b= 3 - 2root2 and n= 0,1,2,3,4,5,...
then R12345 is an integer. Its units digit is..
I didn't have any ideas so I started to plug in numbers looking for a pattern.
I am sure this is not the right approach.

R0 = 1

R1 = 3

R2= 7

R3= 9

Could I get some help?
The following might help although it requires some computation.
Note that $\alpha=3+2\sqrt{2}$ and $\beta=3-2\sqrt{2}$ are roots of $x^2-6x+1=0$.
That is, they are roots of $x^3-6x^2+x=0$. And again, this means they are also roots of $(x^{4115})^3-6(x^{4115})^2+x^{4115}=0$.
The above when simplified gives $x^{12345}=6x^{8230}-x^{4115}$.

Substituting $\alpha$ and $\beta$ in the above and adding we get:

$(3+2\sqrt{2})^{12345}+(3-2\sqrt{2})^{12345}=6((3+2\sqrt{2})^{8230}+(3-2\sqrt{2})^{8230})-((3+2\sqrt{2})^{4115}+(3-2\sqrt{2})^{4115})$

Basically, we now have lower exponents for which we have to calculate. Also, we just need the remainder with $10$. The actual number is really HUGE. If you are familiar with the chinese remainder theorem then you can first find the remainder mod $5$ and then remainder mod $2$ to finally find remainder mod $10$. While finding remainder mod $5$, you can knock the hanging $6$ out. I am not sure if this will solve the question but still.

Another approach which comes to mind is the use of the binomial theorem.
To simplyfy computation observe $3+2\sqrt{2}=(1+\sqrt{2})^2$ and $3-2\sqrt{2}=(1-\sqrt{2})^2$. I was not able to find remainders mod $10$ of the binomial coefficients which come in our way though.

I have to go to class, I will get back to this later. If you are able to solve this using the above mentioned things or otherwise then post it here.
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top