Multiplicative character sums with the Euler function

Sanka Balasuriya,Igor E. Shparlinski,Daniel Sutantyo

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA（2009）

引用 5|浏览2

暂无评分

摘要

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

查看译文

关键词

Euler function,Mobius function,divisor function,character sums

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要