The square-free sieve conjecture
Let be square-free. The square-free sieve conjecture. The set of integers for which is divisible by the square of a prime larger than has density . This conjecture controls large squared prime divisors in polynomial values and is used together with Chowla's conjecture in the paper's conditional classification results. The source gives no resolution status.
References
Primary source
Sandro Bettin, Chantal David and Christophe Delaunay, “Non-isotrivial elliptic surfaces with non-zero average root number”, arXiv:1612.03095 (2018).
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.