English

Sums of the Form 1/x_1^k + ... + 1/x_n^k Modulo a Prime

Number Theory 2007-05-23 v2 Combinatorics

Abstract

We show that for every 0<ϵ10 < \epsilon \leq 1 and integer k1k\geq 1, there exists an integer n=n(ϵ,k)n = n(\epsilon,k) so that for all primes pp, and integers 0ap10 \leq a \leq p-1, there exist integers 1x1<...<xnpϵ1 \leq x_1 < ... < x_n \leq p^\epsilon such that ax11+...+xn1(modp)a \equiv x_1^{-1} + ... + x_n^{-1} \pmod{p}. This extends a result of I. Shparlinski.

Keywords

Cite

@article{arxiv.math/0403360,
  title  = {Sums of the Form 1/x_1^k + ... + 1/x_n^k Modulo a Prime},
  author = {Ernie Croot},
  journal= {arXiv preprint arXiv:math/0403360},
  year   = {2007}
}

Comments

Light Corrections. The parameter h in the definition of T had to be a lot larger