Question

I feel that the following problem should be known, but I'm not sure where to look for it.

Fix a real constant $\frac{1}{2} \ge \epsilon > 0$. For varying primes $p$, Let $A_p$ denote the set of residue classes coming from the first $\lfloor p \epsilon \rfloor$ integers. Let $B_p$ denote the squares (modulo $p$) of the elements of $A_p$. Then one might ask whether $$\lim_{p \rightarrow \infty} \frac{|A_p \cap B_p|}{|A_p|} =^{?} \epsilon.$$ It's true for $\epsilon = \frac{1}{2}$, but that's a degenerate case where $B_p$ can essentially be replaced by $\mathbf{F}^{\times 2}_p$, in which case the answer follows from any non-trivial upper bound on character sums (say the Polya-Vinagradov inequality). Is it true more generally?

Answer 1

This is a variant of a common theme. It should follow from more or less standard exponential sums estimates. The general buzzword is Erdos-Turan inequality. The answer should be yes and it might follow from the results of:

A. Granville, I. E. Shparlinski and A. Zaharescu, On the distribution of rational functions along a curve over $\mathbb{F}_p$ and residue races, J. Number Theory, 112 (2005), 216--237.

or C. Cobeli and A. Zaharescu, On the distribution of the $\mathbb{F}_p$-points on an affine curve in $r$ dimensions, Acta Arithmetica 99 (2001), 321--329.

Or perhaps even earlier papers.

Answer 2

Based on a couple of experiments it seems very likely. There is a slight bias to be over $\epsilon$, maybe because the squares of the residues up to $\sqrt{\frac{p}{\epsilon}}$ are in the intersection and the later squares are pretty randomly scattered around. In the limit that effect goes to 0.