n = 1 ∑ ∞ 2 n F n
Find the sum above, where F n is the n th Fibonacci number that is F 0 = 0 , F 1 = 1 and F n = F n − 1 + F n − 2 for n ≥ 2 .
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.
Sir, isn't is so that before assigning a variable to an infinite sum, you must show that the sum is converging as well?
Log in to reply
You are right. But I don't know how. It is given here (eqn. 16) that n = 0 ∑ ∞ F n x n = 1 − x − x 2 x
Log in to reply
Maybe by the ratio test it can be proven. This is the idea which I have in mind:
Let a n denote the n th term of this sequence. If n → ∞ lim a n a n + 1 < 1 , we have absolute convergence.
We can show that n → ∞ lim F n x n F n + 1 x n + 1 < 1 like this
n → ∞ lim F n x n F n + 1 x n + 1 = n → ∞ lim F n F n + 1 ⋅ n → ∞ lim x = ϕ ⋅ x
Which absolutely converges for x < ϕ 1 ≈ 0 . 6 1 8 .
Since in this problem it was given that x = 2 1 , so it satisfies the absolute convergence.
Log in to reply
@Tapas Mazumdar – Nicely done, Tapaz! (Root test also works here!) As a difficult challenge, try to prove that it converges using Cauchy condensation test as well.
It's uncommon to see that people are willing to write down the complete solution these days. People should aspire to be like you. You'll make a good mathematician one day~!
Log in to reply
@Pi Han Goh – I'm unfamiliar with Cauchy condensation test as of now. I would get some knowledge on this and then get back to your challenge.
PS, can you suggest some external web links that can help me (I searched for it or Brilliant but couldn't find any)?
And thank you sir! :-)
Everyone who attempted got this right
Problem Loading...
Note Loading...
Set Loading...
S ⟹ 4 S ⟹ S = n = 1 ∑ ∞ 2 n F n = 2 1 + n = 2 ∑ ∞ 2 n F n = 2 1 + n = 0 ∑ ∞ 2 n + 2 F n + F n + 1 = 2 1 + 4 1 n = 0 ∑ ∞ 2 n F n + 2 1 n = 0 ∑ ∞ 2 n + 1 F n + 1 = 2 1 + 4 1 n = 1 ∑ ∞ 2 n F n + 2 1 n = 1 ∑ ∞ 2 n F n = 2 1 + 4 S + 2 S = 2 1 = 2 S converges (see note) Note that F 0 = 0 Note that S = n = 1 ∑ ∞ 2 n F n
Ratio Test as suggested by @Tapas Mazumdar
L = n → ∞ lim ∣ ∣ ∣ a n a n + 1 ∣ ∣ ∣ = n → ∞ lim ∣ ∣ ∣ ∣ F n F n + 1 ⋅ 2 n + 1 2 n ∣ ∣ ∣ ∣ = 2 1 n → ∞ lim F n F n + 1 = 2 φ < 1 where φ = 2 1 + 5 is the golden ratio.
Therefore, S = n = 1 ∑ ∞ 2 n F n converges.