Coprime-factor congruence conjecture in short intervals

About 20 years old · traced to

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 N≥qθN\geq q^\theta, the congruence

xy≡c(modq)xy\equiv c\pmod q

has solutions satisfying

CθN≤x,y≤2Cθ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.

References

Primary source

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

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.