Synthetic infinite product

Algebra Level 5

100 i = 1 ( 1 + 1 a i ) \large \left \lfloor 100 \prod_{i=1}^\infty \left(1 + \frac1{a_i} \right) \right \rfloor

Consider the recurrence relation a i + 1 = i ( 1 + a i ) a_{i+1} = i (1+a_i) with initial term a 1 = 1 a_1 = 1 , what is the value of the expression above?


The answer is 371.

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.

1 solution

Abhinav Raichur
Dec 22, 2015

Let P L P_{L} denote the finite form of the infinite product above Then we have, P L = i = 1 L ( 1 + 1 a i ) = i = 1 L ( a i + 1 ) ( a i ) P_{L} = \prod_{i=1}^{L} (1 + \frac{1}{a_{i}}) = \prod_{i=1}^{L} \frac{( a_{i} + 1)}{(a_{i})}

P L = a 1 + 1 a 1 × a 2 + 1 a 2 × a 3 + 1 a 3 . . . . . . . . . . × a L + 1 a L P_{L} ={\frac{a_{1}+1}{a_{1}}} \times {\frac{a_{2}+1}{a_{2}}} \times {\frac{a_{3}+1}{a_{3}}} .......... \times {\frac{a_{L}+1}{a_{L}}}

We will shift the terms below to the left by one place ....

P L = 1 a 1 a 1 + 1 a 2 × a 2 + 1 a 3 × . . . . . . . × ( a L + 1 ) P_{L} = \frac{1}{a_{1}} \frac{a_{1}+1}{a_{2}} \times \frac{a_{2}+1}{a_{3}} \times ....... \times (a_{L}+1)

The a L + 1 a_{L}+1 term is lonely ... So lets divide and multiply by a L + 1 a_{L+1} we get

P L = a L + 1 a 1 a 1 + 1 a 2 × a 2 + 1 a 3 × . . . . . . . × a L + 1 a L + 1 P_{L} = \frac{a_{L+1}}{a_{1}} \frac{a_{1}+1}{a_{2}} \times \frac{a_{2}+1}{a_{3}} \times ....... \times \frac{a_{L}+1}{a_{L+1}}

Now we will use the given data a L + 1 = L ( 1 + a L ) a_{L+1} = L(1+a_{L}) OR 1 L = 1 + a L a L + 1 \frac{1}{L} = \frac{1+a_{L}}{a_{L+1}} and a 1 = 1 a_{1} = 1 Hence, our previous equation turns out to be

p L = a L + 1 1 ( 1 1 × 1 2 × 1 3 . . . . . . . . × 1 L ) p_{L} = \frac{a_{L+1}}{1} ( \frac{1}{1} \times \frac{1}{2} \times \frac{1}{3} ........ \times \frac{1}{L} )

p L = a L + 1 L ! p_{L} = \frac{a_{L+1}}{L!}

Now taking limit as L tends to infinity we get the value of the actual infinite product

lim L P L = lim L a L + 1 L ! = i = 1 ( 1 + a i a i ) \lim_{L \to \infty} P_{L} = \lim_{L \to \infty} \frac{a_{L+1}}{L!}= \prod_{i=1}^{\infty}(\frac{1+a_{i}}{a_{i}})

Evaluating the limit is not that easy, as it requires to observe a pattern in the n t h n^{th} 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 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! (1 + a_{1})

a n + 1 = n + n ( n 1 ) + n ( n 1 ) ( n 2 ) + . . . . . + n ! . 2 a_{n+1} = n + n(n-1) + n(n-1)(n-2) + ..... + n! . 2

now picking n! common we get

a n + 1 n ! = ( 2 + 1 1 ! + 1 2 ! + 1 3 ! + . . . . . . + 1 ( n 1 ) ! ) \frac{a_{n+1}}{n!} = ( 2 + \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + ...... + \frac{1}{(n-1)!} )

Now taking limit as n tends to infinity we get ...

lim n a n + 1 n ! = lim n ( 2 + 1 1 ! + 1 2 ! + 1 3 ! + . . . . . . + 1 ( n 1 ) ! ) \lim_{n \to \infty} \frac{a_{n+1}}{n!} = \lim_{n \to \infty} ( 2 + \frac{1}{1!} + \frac{1}{2!} + \frac{1}{3!} + ...... + \frac{1}{(n-1)!} )

Using the series expansion for euler constant e we get the limit to be ......

i = 1 ( 1 + a i a i ) = lim n a n + 1 n ! = ( 1 + e ) \prod_{i=1}^{\infty}(\frac{1+a_{i}}{a_{i}}) = \lim_{n \to \infty} \frac{a_{n+1}}{n!} = (1 + e)

Where e = 2.71828 and, [ . ] [.] denotes the greatest integer function.

Hence the required answer is [ 100. ( 1 + e ) ] = 371 [100.(1+e)] = 371 is the required answer.

I did the same, except I arrived at the form for a n a_{n} by a combinatorial argument. :D

Soumava Pal - 5 years, 3 months ago

Log in to reply

@Soumava Pal wow ... interested .... you related it to some combinatorial problem ... Like the letters and envelopes problem?

Abhinav Raichur - 5 years, 3 months ago

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 a_{n}=nPn+nP(n-1)+...+nP1 , and then I claimed that a n 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 a_{n} satisfies the given recursive relation.

Soumava Pal - 5 years, 3 months ago

Log in to reply

@Soumava Pal Cool. :) ... Should've observed that!

Abhinav Raichur - 5 years, 3 months ago

Log in to reply

@Abhinav Raichur Yeah, a combinatorial argument just makes it a whole lot interesting.

Soumava Pal - 5 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...