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 language | English |
|---|---|
| Pages (from-to) | 223-229 |
| Number of pages | 7 |
| Journal | Studia Scientiarum Mathematicarum Hungarica |
| Volume | 46 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Jun 2009 |