On the distribution of consecutive square-free primitive roots modulo p

Title:

On the distribution of consecutive square-free primitive roots modulo p

Creator:

Liu, Huaning and Dong, Hui

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:a6927421-d51b-4501-9fe8-992fcc898b96
uuid:a6927421-d51b-4501-9fe8-992fcc898b96
issn:0011-4642

Subject:

mathematics, square-free, primitive root, square sieve, character sum, 13, and 51

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

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} ≡ 1 (mod 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. Let A(n) be the characteristic function of the square-free primitive roots modulo p. In this paper we study the distribution \sum\limits_{n \leqslant x} {A(n)A(n + 1)} and give an asymptotic formula by using properties of character sums., Huaning Liu, Hui Dong., and Obsahuje seznam literatury

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

555-564

Source:

Czechoslovak Mathematical Journal | 2015 Volume:65 | Number:2

Harvested from:

CDK

Metadata only:

false