distribution of special sequences modulo a large prime分布的特殊序列模一个大素数.pdfVIP

IJMMS 2003:50, 3189–3194 PII. S0161171203206074 © Hindawi Publishing Corp. DISTRIBUTION OF SPECIAL SEQUENCES MODULO A LARGE PRIME M. Z. GARAEV and KA-LAM KUEH Received 18 June 2002 We study the sets {gx −gy (mod p) : 1 ≤ x, y ≤ N } and {xy : 1 ≤ x, y ≤ N } where p is a large prime number, g is a primitive root, and p2/3 N p. 2000 Mathematics Subject Classification: 11A07. 1. Introduction. Let p be a large prime number, g a primitive root (mod p), and N a given positive integer, N p . In a series of papers, the distribution of powers gn (mod p) has been investigated by [ 1, 2, 4, 5]. Vâjâitu and Zaharescu [5] considered the question of A. Odlyzko concerning the set of differences x −gy (mod p) : 1 ≤ x, y ≤ N . (1.1) A := g As it was indicated in [ 5], A. Odlyzko asks for which values of N the set A contains all residue classes (mod p). The conjecture is that one can take N to be as small as p1/2+ε , for any positive ε and p c with some c = c(ε). From the result of Rudnick and Zaharescu [4] it follows that in Odlyzko’s problem one can take N = c0 p3/4 log p for some absolute constant c0 . One of the main results of [5] is that for the exceptional set of Odlyzko’s problem we have 3 p log p # h(mod p) : h ∉ A . (1.2) N 3 It then follows that for N p 2/3+ε almost all the residues (mod p) belong to A. Denote B = xy(mod p) : 1 ≤ x, y ≤ N . (1.3)