a n + 1 + 1 = ( n + 1 ) a n
Define an sequence { a n } n = 0 by the iteration above. For what value of a 0 will the iteration converge to some finite value?
Report your answer as first four digits of a 0 (without rounding off). For example, if your answer is 3 . 1 4 1 5 9 2 6 5 3 7 8 9 … then enter 3.141.
Interestingly in the complete number line there exists only one possible value of a 0 , for which this iteration doesn't diverge (that's the interesting aspect of it)
The sequence diverge to positive infinity for any starting value larger than a 0 , and the sequence diverge to negative for any starting value smaller than a 0 .
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.
Yep! Correct! BTW, even ore fancy notation would be to write sum of permutations(which can be proven by using Gamma function) too like a n = n ! a 0 − e ( Γ ( n + 1 , 1 ) − n ! )
a n = n ! ( a 0 + 1 ) − e Γ ( n + 1 , 1 )
This is because this will be the general term and not the above summation one. *From here too, e − 1 can be easily found.
Good job! This is right.
Same way! awesome question though, looks hard at first sight ,
but it is necessary to first show that if the sequence does converge, its gonna be at 0, which can ofcourse be easily shown by using a n − 1 = a n
only then, we can claim that the only value is 1.718
The given relation is:
a n + 1 + 1 = ( n + 1 ) a n
Divide by ( n + 1 ) !
( n + 1 ) ! a n + 1 + ( n + 1 ) ! 1 = n ! a n
Let n ! a n = T n
So we get
T n + 1 − T n = − ( n + 1 ) ! 1
Now as n → ∞ a n + 1 = a n so a ∞ = 0
Solving the above sequence we get
a 0 = n = 0 ∑ ∞ n ! 1
∴ a 0 = e − 1
I think your summation (second to last) should start at $1$. Other than that, great solution!
Problem Loading...
Note Loading...
Set Loading...
This isn't a very formal solution, so I apologise.
Starting off with a 0 :
a 0 = a 0 a 1 = 1 ! a 0 − 1 a 2 = 2 ! a 0 − 1 ! 2 ! − 2 ! 2 ! a 3 = 3 ! a 0 − 1 ! 3 ! − 2 ! 3 ! − 3 ! 3 !
Going on, we see that
a n = n ! × a 0 − 1 ! n ! − 2 ! n ! − … − n ! n ! = n ! ( a 0 − k = 1 ∑ n k ! 1 )
The only way for a n to converge as n → ∞ is for
a 0 = k = 1 ∑ n k ! 1
Since our RHS is e − 1 by the Taylor series of e x , a 0 = e − 1 ≈ 1 . 7 1 8 . The sequence thus converges to 0 .