Multiplicative character sums with the sum of g-ary digits function

William D. Banks*, Igor E. Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)215-219
Number of pages5
JournalRamanujan Journal
Issue number2
Publication statusPublished - Apr 2006


Dive into the research topics of 'Multiplicative character sums with the sum of g-ary digits function'. Together they form a unique fingerprint.

Cite this