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

dc.creatorCroot, Ernie
dc.date2004-03-22
dc.date2004-10-21
dc.date.accessioned2026-07-07T05:06:37Z
dc.date.available2026-07-07T05:06:37Z
dc.descriptionWe show that for every $0 < ε\leq 1$ and integer $k\geq 1$, there exists an integer $n = n(ε,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^ε$ such that $a \equiv x_1^{-1} + ... + x_n^{-1} \pmod{p}$. This extends a result of I. Shparlinski.
dc.descriptionLight Corrections. The parameter h in the definition of T had to be a lot larger
dc.identifierhttps://arxiv.org/abs/math/0403360
dc.identifierhttp://arxiv.org/abs/math/0403360
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70540
dc.subjectNumber Theory
dc.subjectCombinatorics
dc.subject11P99
dc.titleSums of the Form 1/x_1^k + ... + 1/x_n^k Modulo a Prime
dc.typetext

Files

Collections