Skip to content

Sums of the Form 1/x1k + ... + 1/xnk Modulo a Prime

Ernie Croot

math.NTarXiv:math/0403360

Abstract

We show that for every 0 < ε≤ 1 and integer k≥ 1, there exists an integer n = n(ε,k) so that for all primes p, and integers 0 ≤ a ≤ p-1, there exist integers 1 ≤ x1 < ... < xn ≤ pε such that a x1-1 + ... + xn-1 p. This extends a result of I. Shparlinski.

Create a lesson