Thursday, 19 December 2013

radicals - Combinatorial proof of a relation between the number of distinct prime divisors of a number and the Riemann zeta function.

Recently I've been learning about the basics of Dirichlet functions and their relations to subjects in number theory that I would characterise as combinatorial in nature. I came across this identity:
ζ(s)2ζ(2s)=n12ν(n)ns,


Here ζ denotes the Riemann zeta function, and ν(n) is the number of distinct prime divisors of n.
I'm able to prove that this identity holds (for all sC with (s)>1) by writing both sides as Euler products and rearranging terms. However, I also noticed that
ζ(s)2=n1σ0(n)ns and n12ν(n)ns=n1σ0(rad(n))ns,

where σ0(n) denotes the number of positive divisors of n and rad(n) denotes the radical of n. This suggests to me that there might be some sort of counting argument for the identity above.




Unfortunately I'm unable to make such an argument work. I've tried rewriting the left hand side in a few ways, for example using
ζ(2s)1=n1μ(n)n2s=n1τ(n)ns,


where μ denotes the Möbius function and τ is rather ugly, see below, to get
ζ(s)2ζ(2s)=n1(dnτ(d)σ0(nd))ns,

so I'd like to show that dnτ(d)σ0(nd)=σ0(rad(n)), where τ is given by
τ(n):={μ(n) if n is a square0 if n is not a square={μ(rad(n)) if n=rad(n)20 otherwise ={(1)2logσ0(rad(n)) if n=rad(n)20 otherwise 

But I can't quite seem to fit these ingredients together. A hint as to how to write τ and/or how to rewrite the sum dnτ(d)σ0(nd) would be much appreciated. This is homework, by the way.

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}...