Monday, 31 October 2016

number theory - sumin=1nftychi(n)phi(n)ns=fracL(chi,s1)L(chi,s)

Let χ be a Dirichlet character mod 4. Show n=1χ(n)ϕ(n)ns=L(χ,s1)L(χ,s) and n=1χ(n)d(n)ns=L(χ,s)2. (ϕ is the Euler totient function and d(n) is the number of divisors of n.)




First, is this true just for characters mod 4 and not true in general?
I'm not sure what specific properties about characters mod 4 I should use besides that χ(n)=0 for n even.



I took the log of both sides and tried to use the following:
L(χ,s)=p prime11χ(p)ps



logL(χ,s)=p primen=1χ(p)nnpns



χ and ϕ are multiplicative, so we can express n=1χ(n)ϕ(n)ns as the Euler product p(1+χ(p)ϕ(p)ps+χ(p2)ϕ(p2)p2s+).




Manipulating things are not quite working. Any help would be appreciated.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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