Saturday, 13 January 2018

sequences and series - What about the asymptotic behaviour of sumNn=1fraclogoperatornamerad(n)n as Ntoinfty?




Motivation. Let μ(n) the Möbius function and we denote with rad(n)=pnp

the radical of an integer n1, see this Wikipedia.



Fact. Using that μ(n)=0 iff $\operatorname{rad}(n)MathWorld, (by cases 1) μ(n)=0, 2) rad(n)=n with μ(n)=1 and 3)rad(n)=n with μ(n)=1 ) one can to prove n=1μ(n)nlograd(n)=1.



Since series involving rad(n) are interestings, I've thought this exercise:




Question. We know Chebyshev's result about the asymptotic behaviour of pnlogpp and since the series n=1lograd(n)n

has positive terms, I know that it diverges. But, is it possible to deduce some more precisely about the asymptotic behaviour of the partial sums Nn=1lograd(n)n
as N? Provide hints, or a detailed answer, as you prefer. Or references if it is well known. Many thanks.



Answer




In the following, p always runs over primes, and n,k over positive integers. By changing the order of summation, we obtain



nxlog(radn)n=nxpnlogpn=pxnxpnlogpn=pxlogppkx/p1k=pxlogpp(logxp+γ+O(px))=logxpxlogpppx(logp)2p+γpxlogpp+O(1xpxlogp).




From the prime number theorem, we have the strengthening of Mertens' first theorem that there is a constant C such that



pxlogpp=logx+C+o(1).



Also, ϑ(x)=pxlogpx, so it remains to find the behaviour of



px(logp)2p=(logx+C+o(1))logxx2logt+C+o(1)tdt=(logx)2+Clogx+o(logx)12((logx)2(log2)2)Clogx+Clog2o(logx)=12(logx)2+o(logx)



to overall get



nxlog(radn)n=12(logx)2+(C+γ)logx+o(logx).


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...