Define f ( x ) as f ( x ) = n = 0 ∑ ∞ n + 1 a n x n + 1 with a n = L n + 1 which L n is Lucas sequence, L 0 = 2 , L 1 = 1 If f ( 2 1 ) can be written as ln ( k ) , calculate k
Note: a n + 2 = a n + 1 + a n and L n + 2 = L n + 1 + L n
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.
Since the Lucas sequence is a linear recurrence relation ( L n + 2 = L n + 1 + L n ), it has a closed form expression L n = ( 2 5 + 1 ) n + ( 2 1 − 5 ) n
We start with f ′ ( x ) = n = 0 ∑ ∞ a n x n = n = 0 ∑ ∞ L n + 1 x n The expression for L n indicates that this is just a geometric sequence that can be written as f ′ ( x ) = n = 0 ∑ ∞ ( 2 5 + 1 ) ( 2 5 + 1 x ) n + ( 2 1 − 5 ) ( 2 1 − 5 x ) n
Now, x ∈ [ 0 , 2 1 ] , so the sequence converges. Summing the sequence and integrating both sides from 0 to 2 1 gives us f ( 2 1 ) − f ( 0 ) = ∫ 0 2 1 ( 2 − x ( 5 + 1 ) 5 + 1 + 2 − x ( 1 − 5 ) 1 − 5 ) d x = ∫ 0 2 1 1 − x − x 2 2 x + 1 d x
Hence, f ( x ) = − ln ( 1 − x − x 2 ) , by which f ( 2 1 ) = ln 4
Problem Loading...
Note Loading...
Set Loading...
Here is a sketch.
f ′ ( x ) = n = 0 ∑ ∞ a n x n = 1 − x − x 2 2 x + 1
f ( x ) = − ln ( 1 − x − x 2 )
Plugging x = 2 1 in we get f ( 2 1 ) = ln ( 4 ) ⟹ k = 4