Let { F n } to be the Fibonacci's sequence , where F 1 = F 2 = 1 and F n + 1 = F n + F n − 1 , ∀ n ≥ 2 , and n = 1 ∑ ∞ arctan ( F 2 n + 1 1 ) = B A π , where A and B are coprime positive integers. Find 1 0 A + B .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Another lovely problem, compañero!
Let c n = arctan ( F n 1 ) . The identity c 2 n = c 2 n + 1 + c 2 n + 2 follows from the addition theorem for tan and Cassini's identity. By induction we find 4 π = c 2 = c 2 N + 2 + ∑ n = 1 N c 2 n + 1 . The limit as N tends to infinity is 4 π = ∑ n = 1 ∞ c 2 n + 1 so that the answer is 1 0 × 1 + 4 = 1 4
Thank you very much Otto,(encouragement) ↑ .I have some problems with my computer, I have to change it...maybe I can't answer some replies in some time ... I have just understood your proof now,It has taken me some time... My proof is a "botched job".. I consider arctan like a complex main "log" when 0 < |x| < 1... I'm sure, my proof is wrong...
Otto, I have liked so much your proof. With your permission, I would like to make a whole translation of your proof, can I,please?.I found this result in a book about π , with fascinating formulas, like this,or this one from Euler π = k = 1 ∏ ∞ ( 1 + p k sin 2 π p k ) 2 with { p k } wrapping the set of prime numbers, but it is a science popular book without demonstrations... I repeat, sorry, your proof is wonderful,can I do a "whole" translation of your proof, please?
Log in to reply
Yes, by all means!
Log in to reply
Thank you very much, I'm going to use "everything" I know for my approach of your proof, even D'Alembert convergence criterion " n → ∞ lim a n a n + 1 < 1 ..." for seeing actually firstly the series converges. In this case, the series absolutely converges and we can sum the terms inconditionally... in any order..
A mindblowing problem and solution....mesmerized wanna give +100 tho!!!!
Problem Loading...
Note Loading...
Set Loading...
This is only my humble approach from "thundering" Otto Bretscher's solution.
We are considering the function arctan : ( − ∞ , ∞ ) → ( 2 − π , 2 π ) as an inverse function of a bijective function strictly increasing( tan )
1.- Let c n = arctan ( F n 1 ) and firstly we are going to see this sequence n = 1 ∑ ∞ c 2 n + 1 converges. For it, I'm going to use Taylor series of arctan ( x ) ~ x as x → 0 and D'Alembert convergence criterium n → ∞ lim c 2 n + 1 c 2 n + 3 = n → ∞ lim F 2 n + 3 F 2 n + 1 = n → ∞ lim F 2 n + 2 F 2 n + 1 ⋅ F 2 n + 3 F 2 n + 2 = ϕ 2 1 < 1 ⇒ the sequence n = 1 ∑ ∞ c 2 n + 1 converges,where ϕ is the golden ratio. This means the series n = 1 ∑ ∞ c 2 n + 1 x n has radius of convergence ρ = ϕ 2 ,i.e, the series converges if ∣ x ∣ < ρ = ϕ 2 and x ∈ R , even if x ∈ C and ∣ x ∣ < ρ = ϕ 2
2.- The second part is only a translation from Otto's, using Cassini's identity ( F n + i F n + j − F n F n + i + j = ( − 1 ) n F i F j ) F 2 n − 1 F 2 n + 2 − 1 = F 2 n − 1 F 2 n + 2 + ( − 1 ) 2 n − 1 F 1 F 2 = F 2 n F 2 n + 1 ⟺ ⟺ ( F 2 n − 1 + F 2 n ) F 2 n + 2 − 1 = F 2 n ( F 2 n + 1 + F 2 n + 2 ) ⟺ F 2 n + 1 F 2 n + 2 − 1 = F 2 n ( F 2 n + 1 + F 2 n + 2 ) ⟺ ⟺ F 2 n 1 = F 2 n + 1 F 2 n + 2 − 1 F 2 n + 1 + F 2 n + 2 ⟺ tan ( c 2 n ) = tan ( c 2 n + 1 + c 2 n + 2 ) ⟺ c 2 n = c 2 n + 1 + c 2 n + 2 . The rest of proof is exactly equal to Otto's c 3 = c 2 − c 4 c 5 = c 4 − c 6 c 7 = c 6 − c 8 . . .