Multiplicative character sums with the Euler function

Sanka Balasuriya*, Igor E. Shparlinski, Daniel Sutantyo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We give upper bounds for sums of multiplicative characters modulo an integer q ≥ 2 with the Euler function φ(n) and with the shifted largest prime divisor P(n) + a of integers n ≤ x.

Original languageEnglish
Pages (from-to)223-229
Number of pages7
JournalStudia Scientiarum Mathematicarum Hungarica
Volume46
Issue number2
DOIs
Publication statusPublished - Jun 2009

Fingerprint

Dive into the research topics of 'Multiplicative character sums with the Euler function'. Together they form a unique fingerprint.

Cite this