|
|
||||||
Benoit Cloitre is a brilliant maths amateur when he wants. Consider the sequences
![]() In general, for
Then lim n By considering those two
sequences, e and Benoit Cloitre first offered a direct prove, but one can prefer Gery Huvent's prove, from Lille, which allow us to find a general method to prove those sequences. 2.1 For![]() Calculating the first
few terms 0,1,1, ![]() This property can be prove by induction on p, since it's true for p = 1. Suppose that v2p = v2p+1 then ![]() and
![]() ![]() which by induction give us ![]() Taking into account the classical equivalence (obtain with Wallis) ![]() we have ![]()
Note We can find a limited development with Stirling's formula, to get ![]() ![]() Consider the function
that generates the sequence ![]() the given recurrent sequence can be written as ![]() or ![]() by differentiating, we get ![]() hence f is the solutiong to the differential equation ![]() which has the general solution ![]() taking into acount than
u1 = 0 and u2 = 1 = ![]() Now we need to determine the development of the power serie of f so to find each term of the sequence. For this note that ![]() ( ![]() then ![]() using Cauchy's product of two series. Hence ![]() and ![]()
![]() and ![]() more particularly ![]()
Note If we
did the same for the sequence
![]()
![]() which satisfy ![]() with ![]()
back to home page |