Abstract
We give upper bounds for sums of multiplicative characters modulo an integerq≧ 2 with the Euler functionϕ(n) and with the shifted largest prime divisorP(n) +aof integersn≦x.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
