distribution of roots of polynomial congruences多项式的根的分布刻画.pdfVIP

Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Volume 2007, Article ID 37853, 5 pages doi:10.1155/2007/37853 Research Article Distribution of Roots of Polynomial Congruences Igor E. Shparlinski Received 7 March 2007; Accepted 7 June 2007 Recommended by George E. Andrews For a prime p , we obtain an upper bound on the discrepancy of fractions r/p, where r runs through all of roots modulo p of all monic univariate polynomials of degree d whose vector of coefficients belongs to a d-dimensional box . The bound is nontrivial starting with boxes of size | | ≥p d/2+ε for any fixed ε 0 and sufficiently large p . Copyright © 2007 Igor E. Shparlinski. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 1. Introduction For an integer m and a polynomial f (X ) ∈ Z [X ], we consider the set of fractions m,f = r |f (r) ≡ 0 (mod m), 0 ≤ r ≤ m − 1, (1.1) m that is, the set of fractions r/m where r runs through all distinct roots of the congruence f (r) ≡ 0(mod m). Hooley [1] has proved that for any irreducible polynomial f (X ) ∈ Z [X ], the sequence f (X ) of all fractions r/m ∈ m,f taken over all nonnegative integers m ≤ X , that is, f (X ) = r , (1.2) m r ∈m,f , m≤X is asymptotically uniformly distributed in the [0,1] interval when X → ∞, although the bound on the discrepancy of the sequence f (X ) is rather weak. For quadratic polyno- mials f a stronger bound on the discrepancy has been obtained using a different method by Hooley [2], see [3, 4] for further references to more recent improvem