Distribution of Residues Modulo p

نویسندگان

  • S. Gun
  • Florian Luca
  • P. Rath
  • B. Sahu
چکیده

The distribution of quadratic residues and non-residues modulo p has been of intrigue to the number theorists of the last several decades. Although Gauss’ celebrated Quadratic Reciprocity Law gives a beautiful criterion to decide whether a given number is a quadratic residue modulo p or not, it is still an open problem to find a small upper bound on the least quadratic non-residue mod p as a function of p, at least when p ≡ 1 (mod 8). This is because for any given natural number N one can construct many primes p ≡ 1 (mod 8) having the first N positive integers as quadratic residue (see, for example, Theorem 3 below).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distribution of Quadratic Non-residues Which Are Not Primitive Roots

In this article we study, using elementary and combinatorial methods, the distribution of quadratic non-residues which are not primitive roots modulo p or 2p for an odd prime p and h > 1 an integer. MSC 2000 : 11N69

متن کامل

On the Distribution of Quadratic Residues and Nonresidues Modulo a Prime Number

Let P be a prime number and al, at be distinct integers modulo P. Let x be chosen at random with uniform distribution in Zp , and let yi = x + ai . We prove that the joint distribution of the quadratic characters of the yi 's deviates from the distribution of independent fair coins by no more than t(3 + xfi-)/P. That is, the probability of (Yi, ...Y, t) matching any particular quadratic charact...

متن کامل

On the Distribution of Exponential Sums

We discuss three problems of the following kind: given a set A ⊆ Fp of n := |A| residues modulo a prime p, how are the absolute values |SA(z)| of the corresponding exponential sums SA(z) := ∑ a∈A e 2πi p ; z ∈ Fp distributed in the interval [0, n]?

متن کامل

On Periods modulo a Prime of Some Classes of Sequences of Integers

Theorem 1: Let un, n > 0, be the general term of a given sequence of integers and define the transformation T^yk)(un) as T^xyJc){un) = xun+lc +yun for every n > 0, A: being a positive integer. Then, if x mdy are nonzero integers and there exists a positive prime number/? which divides T(x,y,k)(n) f° every n>0 and is relatively prime to x, the distribution of the residues of (un) modulo p is eit...

متن کامل

Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values

Motivated by a recently introduced HIMMO key distribution scheme, we consider a modification of the noisy polynomial interpolation problem of recovering an unknown polynomial f(X) ∈ Z[X] from approximate values of the residues of f(t) modulo a prime p at polynomially many points t taken from a short interval.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006