|
| > > > > > > > |
Consider the sequence given by the recursion a0 = 1, a1=1/3, an+1 = 2/3*an - an-1 (n ≥ 1). Prove that there exists a positive integer n such that an > 0.9999. I wrote a program, and I found that a245 = 0.999969287. Can anybody give an exact mathematical proof? |
| Answer: Yes, here is the proof that an
= cos nθ, where θ = cos-1 1/3.
Proof, by induction:
If θ/π is rational, an is periodic, so there exists an n
such that an=a0=1; This proof doesn't depend on θ/π being irrational. It's not hard to show that θ/π is irrational, though. 2 cos nθ is a monic polynomial in 2 cos θ with integer coefficients
(obvious if you think about it, since 2 cos θ = eiθ + e-iθ).
Hence if 2 cos nθ is 2 for any n > 0, 2 cos θ has to satisfy a nontrivial
monic polynomial equation over As for the interesting patterns found in the investigation, cos-1 1/3 = θ = 1.23095941734077 51θ = 62.7789302843795, and
10(2π) = 62.8318530717959, so 51θ is just 0.08% less than 10 trips around
the circle. By interspersing 54 groups of 46θ, (about 9 trips around the circle) with 77 groups of 51θ, (about 10 trips around the circle), we get a total of 6411θ, which is almost exactly (to within 0.000001%, or one part in 100 million) 1256 trips around the circle. The ratio of the number of θ's to the number of trips around the circle, 6411/1256=5.1043, is the primary observed period of this sequence. The weighted average of 54 groups of 46θ and 77 groups of 51θ (131 groups in all) needed to make all these trips around the circle is about 6411/131=48.9389, which is the second-order period that was observed in the investigation. |
|
The webmaster and author of this Math Help site is Graeme McRae.