Coprime-factor congruence conjecture in short intervals

From papers

Let θ\theta satisfy 1/2<θ11/2<\theta\leq 1. Let qq be a positive integer and let cc be an integer with (c,q)=1(c,q)=1. Coprime-factor congruence conjecture in short intervals. There is a constant CθC_\theta such that, for every NqθN\geq q^\theta, the congruence

xyc(modq)xy\equiv c\pmod q

has solutions satisfying

CθNx,y2CθN,C_\theta N\leq x,y\leq 2C_\theta N,

and (x,y)=1(x,y)=1. This is presented as a variation of the preceding congruence conjecture; the supplied text gives no resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Tsz Ho Chan, “Approximating reals by sums of two rationals”, arXiv:math/0609322 (2007).

Solutions 0

No solutions have been posted yet.