A ( x ) = x + x + x + ⋱ 1 1 1 With A ( x ) defined as above, where the continued fraction goes on indefinitely, find the value of the infinite product A ( 1 ) 1 × A ( 1 ) 1 + 1 1 × A ( 1 ) 1 + 1 + 1 1 1 × ⋯ . If your answer can be expressed as c b a + b , where a , b , c are positive integers and b is square-free, give your answer as 1 0 0 a + 1 0 b + c .
Bonus: Can you give a closed formula for A ( y ) y × A ( y ) y + y 1 × A ( y ) y + y + y 1 1 × ⋯ when it converges?
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.
Define the truncated version of A ( x ) as
A k ( x ) = k x’s x + x + x + x 1 ⋱ 1
The product we have to find is
P ( 1 ) = k = 1 ∏ ∞ A ( 1 ) A k ( 1 )
Claim:
A k ( 1 ) = F k F k + 1
Where F k is the k -th Fibonacci number
Proof:
Base case: k = 1
A k ( 1 ) = 1 = 1 1 = F 1 F 2
Induction step: k ⟹ k + 1
Since
A k + 1 ( 1 ) = 1 + A k ( 1 ) 1
It follows that
A k + 1 ( 1 ) = 1 + F k F k + 1 1 = 1 + F k + 1 F k = F k + 1 F k + 1 + F k = F k + 1 F k + 2 c c c c □
Which also gives the value of A ( 1 )
A ( 1 ) = k → ∞ lim A k ( 1 ) = k → ∞ lim F k F k + 1 = ϕ
Considering a finite version of the product
P n ( 1 ) = k = 1 ∏ n ϕ A k ( 1 ) = ϕ n 1 ( F 1 F 2 ⋅ F 2 F 3 ⋅ ⋅ ⋅ F n F n + 1 ) = ϕ n F n + 1
Hence
P ( 1 ) = n → ∞ lim P n ( 1 ) = n → ∞ lim ϕ n F n + 1 = n → ∞ lim ϕ n 5 1 ( ϕ n + 1 − ( − ϕ ) − ( n + 1 ) ) c c c c c c c c c c Binet’s Formula = 5 ϕ = 2 5 1 + 5 = c b a + b
⟹ 1 0 0 a + 1 0 b + c = 1 5 2
First, let's try to write a closed form for A ( x ) . First we notice A ( x ) = x + A ( x ) 1 ( A ( x ) ) 2 = x A ( x ) + 1 ( A ( x ) ) 2 − x A ( x ) − 1 = 0 By the quadratic formula, we get A ( x ) = 2 x ± x 2 + 4 Since in the original equation, we are adding a number to 1 , we can conclude that the ± should be + . Using our new closed form of A ( x ) , we get that A ( 1 ) = 2 1 + 1 2 + 4 = 2 1 + 5 Now, looking at the infinite product, we notice that the reciprocal of A ( 1 ) is multiplied an infinite number of times, so we can take it out and try to evaluate the numerator. Looking at the first few terms, we notice, whenever we go up to the other term, we are simply taking the reciprocal of the previous term and adding 1 . In other words a n = a n − 1 1 + 1 = a n − 1 a n − 1 + 1 Since the terms can always be written in fractional form, we can look at the numerator and denominator separately, so a n − 1 a n − 1 + 1 = q n − 1 p n − 1 q n − 1 p n − 1 + q n − 1 q n − 1 = p n − 1 p n − 1 + q n − 1 where p is the numerator and q is the denominator Notice, the numerator now forms the Fibonacci Sequence. Also, notice, the numerator of the first term and denominator of the second term cancel out when we multiply them, so this product is simply the infinith Fibonacci number. We can evaluate this as a limit, namely n → ∞ lim 5 1 ( 2 1 + 5 ) n + 1 Which is an approximation of the nth Fibonacci Number Now putting this into the overall product, we get n → ∞ lim ( 1 + 5 2 ) n ⋅ 5 1 ( 2 1 + 5 ) n + 1 = 5 1 ⋅ ( 2 1 + 5 ) = 2 5 1 + 5 ⟹ a = 1 , b = 5 , c = 2 , so 1 0 0 a + 1 0 b + c = 1 0 0 + 5 0 + 2 = 1 5 2
Bonus: From what we did above, we can simply get that the closed formula for A ( y ) y × A ( y ) y + y 1 × ⋯ = lim n → ∞ ( A ( y ) 1 ) n × 5 1 ( 2 1 + 5 ) n + 1 = n → ∞ lim ( 2 5 1 + 5 ) ⋅ ( ∣ y ∣ + y 2 + 4 1 + 5 ) n
Your general y formula is wrong. If ∣ y ∣ > 1 , your result says that the limit is 0 , which is not the case. See my solution.
Problem Loading...
Note Loading...
Set Loading...
For y > 0 , define the sequence G n by the recurrence relation G 0 = 0 , G 1 = 1 , G n + 1 = y G n + G n − 1 ( n ≥ 1 ) Then it is a simple induction that the sequence of numerators x n given by the recurrence relation x 1 = y , x n + 1 = y + x n − 1 ( n ≥ 1 ) is given by the formula x n = G n G n + 1 n ≥ 1 We can obtain a generalisation of Binet's formula, in that G n = y 2 + 4 1 [ ( 2 y + y 2 + 4 ) n − ( 2 y − y 2 + 4 ) n ] = y 2 + 4 ϕ ( y ) n − ( − ϕ ( y ) − 1 ) n n ≥ 0 where ϕ ( y ) = 2 y + y 2 + 4 > 1 From this it is clear that A ( y ) = n → ∞ lim x n = n → ∞ lim G n G n + 1 = ϕ ( y ) and that n = 1 ∏ ∞ A ( y ) x n = N → ∞ lim n = 1 ∏ N A ( y ) x n = N → ∞ lim G 1 ϕ ( y ) N G N + 1 = y 2 + 4 ϕ ( y ) = 2 y 2 + 4 y + y 2 + 4 so that, in general, a = y , b = y 2 + 4 and c = 2 . In the case y = 1 , this makes the answer 1 5 2 .
if y < 0 , all the x n terms change sign, and hence the limit A also changes sign (so that A ( − y ) = − A ( y ) ). This means that the sequence of finite products converges to 2 y 2 + 4 ∣ y ∣ + y 2 + 4 for all nonzero y .