I am trying to prove Raabe's test and one of the steps is to show that N∏n=1(1−K/n) is order O(N−K). The book I'm using doesn't give me tools to do this so I'm wondering how it's done.
There's another proof I've found online that involves telescoping sums. However, I am interested in seeing how this proof is done.
Thanks.
Answer
If 0<Kn<1 then we have 1−Kn=elog(1−Kn)=e−Kn−K22n2−O(Kn)3 where we used log(1−x)=−x−x22+O(x3). Fix a M>⌈K⌉ then if N>M we have
N∏n=1(1−Kn)=M−1∏n=1(1−Kn)×N∏n=M(1−Kn)=M−1∏n=1(1−Kn)×N∏n=Me−Kn−K22n2−O(Kn)3=M−1∏n=1(1−Kn)×e−K∑Nn=M1n+O(1)
The first product is independent of N so it's just a constant C and using the asymptotics for the harmonic number ∑Nn=11n=log(n)+γ+O(N−1) we have −K∑Nn=M1n=−Klog(N)+O(1) and it follows that
N∏n=1(1−Kn)=Ce−Klog(N)+O(1)=O(N−K) as N→∞
No comments:
Post a Comment