⎣ ⎢ ⎢ ⎢ 1 0 0 i = 1 ∏ ∞ ( 1 + a i 1 ) ⎦ ⎥ ⎥ ⎥
Consider the recurrence relation a i + 1 = i ( 1 + a i ) with initial term a 1 = 1 , what is the value of the expression above?
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.
I did the same, except I arrived at the form for a n by a combinatorial argument. :D
Log in to reply
@Soumava Pal wow ... interested .... you related it to some combinatorial problem ... Like the letters and envelopes problem?
Log in to reply
Yeah, but not that problem, I recognized the pattern that a n = n P n + n P ( n − 1 ) + . . . + n P 1 , and then I claimed that a n is the total number of permutations of n distinct things, taking any i (0<=i<=n) of them at a time, and then tried to show that this definition of a n satisfies the given recursive relation.
Log in to reply
@Soumava Pal – Cool. :) ... Should've observed that!
Log in to reply
@Abhinav Raichur – Yeah, a combinatorial argument just makes it a whole lot interesting.
Problem Loading...
Note Loading...
Set Loading...
Let P L denote the finite form of the infinite product above Then we have, P L = i = 1 ∏ L ( 1 + a i 1 ) = i = 1 ∏ L ( a i ) ( a i + 1 )
P L = a 1 a 1 + 1 × a 2 a 2 + 1 × a 3 a 3 + 1 . . . . . . . . . . × a L a L + 1
We will shift the terms below to the left by one place ....
P L = a 1 1 a 2 a 1 + 1 × a 3 a 2 + 1 × . . . . . . . × ( a L + 1 )
The a L + 1 term is lonely ... So lets divide and multiply by a L + 1 we get
P L = a 1 a L + 1 a 2 a 1 + 1 × a 3 a 2 + 1 × . . . . . . . × a L + 1 a L + 1
Now we will use the given data a L + 1 = L ( 1 + a L ) OR L 1 = a L + 1 1 + a L and a 1 = 1 Hence, our previous equation turns out to be
p L = 1 a L + 1 ( 1 1 × 2 1 × 3 1 . . . . . . . . × L 1 )
p L = L ! a L + 1
Now taking limit as L tends to infinity we get the value of the actual infinite product
L → ∞ lim P L = L → ∞ lim L ! a L + 1 = i = 1 ∏ ∞ ( a i 1 + a i )
Evaluating the limit is not that easy, as it requires to observe a pattern in the n t h term, considering the recurrence relation we have ....
a n + 1 = n + n ( a n ) = n + n ( ( n − 1 ) + ( n − 1 ) a n − 1 ) = n + n ( n − 1 ) + n ( n − 1 ) a n − 1
It is easy to see that ...
a n + 1 = n + n ( n − 1 ) + n ( n − 1 ) ( n − 2 ) + . . . . . + n ! ( 1 + a 1 )
a n + 1 = n + n ( n − 1 ) + n ( n − 1 ) ( n − 2 ) + . . . . . + n ! . 2
now picking n! common we get
n ! a n + 1 = ( 2 + 1 ! 1 + 2 ! 1 + 3 ! 1 + . . . . . . + ( n − 1 ) ! 1 )
Now taking limit as n tends to infinity we get ...
n → ∞ lim n ! a n + 1 = n → ∞ lim ( 2 + 1 ! 1 + 2 ! 1 + 3 ! 1 + . . . . . . + ( n − 1 ) ! 1 )
Using the series expansion for euler constant e we get the limit to be ......
i = 1 ∏ ∞ ( a i 1 + a i ) = n → ∞ lim n ! a n + 1 = ( 1 + e )
Where e = 2.71828 and, [ . ] denotes the greatest integer function.
Hence the required answer is [ 1 0 0 . ( 1 + e ) ] = 3 7 1 is the required answer.