Abstract
We establish upper bounds for multiplicative character sums with the function σ g (n) which computes the sum of the digits of n in a fixed base g ≥ 2. Our results may be viewed as analogues of some previously known results for exponential sums with sum of g-ary digits function.
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
