Geodesic
On the distribution of consecutive square-free primitive roots modulo $p$
Czechoslovak Mathematical Journal, Tome 65 (2015) no. 2, pp. 555-564 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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.
DOI : 10.1007/s10587-015-0194-1
Classification : 11B50, 11L40, 11N25
Keywords: square-free; primitive root; square sieve; character sum 
@article{10_1007_s10587_015_0194_1,
     author = {Liu, Huaning and Dong, Hui},
     title = {On the distribution of consecutive square-free primitive roots modulo $p$},
     journal = {Czechoslovak Mathematical Journal},
     pages = {555--564},
     year = {2015},
     volume = {65},
     number = {2},
     doi = {10.1007/s10587-015-0194-1},
     mrnumber = {3360445},
     zbl = {06486965},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0194-1/}
}
TY  - JOUR
AU  - Liu, Huaning
AU  - Dong, Hui
TI  - On the distribution of consecutive square-free primitive roots modulo $p$
JO  - Czechoslovak Mathematical Journal
PY  - 2015
SP  - 555
EP  - 564
VL  - 65
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0194-1/
DO  - 10.1007/s10587-015-0194-1
LA  - en
ID  - 10_1007_s10587_015_0194_1
ER  - 
%0 Journal Article
%A Liu, Huaning
%A Dong, Hui
%T On the distribution of consecutive square-free primitive roots modulo $p$
%J Czechoslovak Mathematical Journal
%D 2015
%P 555-564
%V 65
%N 2
%U http://geodesic.mathdoc.fr/articles/10.1007/s10587-015-0194-1/
%R 10.1007/s10587-015-0194-1
%G en
%F 10_1007_s10587_015_0194_1
Liu, Huaning; Dong, Hui. On the distribution of consecutive square-free primitive roots modulo $p$. Czechoslovak Mathematical Journal, Tome 65 (2015) no. 2, pp. 555-564. doi: 10.1007/s10587-015-0194-1

[1] Heath-Brown, D. R.: The square sieve and consecutive square-free numbers. Math. Ann. 266 (1984), 251-259. | DOI | MR | Zbl

[2] Liu, H., Zhang, W.: On the squarefree and squarefull numbers. J. Math. Kyoto Univ. 45 (2005), 247-255. | DOI | MR | Zbl

[3] Mirsky, L.: On the frequency of pairs of square-free numbers with a given difference. Bull. Amer. Math. Soc. 55 (1949), 936-939. | DOI | MR | Zbl

[4] Munsch, M.: Character sums over squarefree and squarefull numbers. Arch. Math. (Basel) 102 (2014), 555-563. | DOI | MR | Zbl

[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 | Zbl

[6] Rivat, J., Sárközy, A.: Modular constructions of pseudorandom binary sequences with composite moduli. Period. Math. Hung. 51 (2005), 75-107. | DOI | MR | Zbl

[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 | Zbl

Cité par Sources :