Sums of the Form 1/x1k + ... + 1/xnk Modulo a Prime
Ernie Croot
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
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan