Article
Keywords:
square-free; primitive root; square sieve; character sum
Summary:
A positive integer $n$ is called a square-free number if it is not divisible by a perfect square except $1$. Let $p$ be an odd prime. For $n$ with $(n,p)=1$, the smallest positive integer $f$ such that $n^f \equiv 1 \pmod p$ is called the exponent of $n$ modulo $p$. If the exponent of $n$ modulo $p$ is $p-1$, then $n$ is called a primitive root mod $p$. \endgraf Let $A(n)$ be the characteristic function of the square-free primitive roots modulo $p$. In this paper we study the distribution $$ \sum _{n\leq x}A(n)A(n+1), $$ and give an asymptotic formula by using properties of character sums.
References:
[5] Pappalardi, F.:
A survey on $k$-freeness. Number Theory S. D. Adhikari et al. Conf. Proc. Chennai, India, 2002 Ramanujan Mathematical Society, Ramanujan Math. Soc. Lect. Notes Ser. 1, Mysore (2005), 71-88.
MR 2131677 |
Zbl 1156.11338
[7] Shapiro, H. N.:
Introduction to the Theory of Numbers. Pure and Applied Mathematics. Wiley-Interscience Publication John Wiley & Sons. 12, New York (1983).
MR 0693458 |
Zbl 0515.10001