The conjectural least-common-multiple asymptotic for x² + y² + 1

About 4 years old · traced to

Let F=x2+y2+1F=x^2+y^2+1, and define

ψF(N)=log⁡(LCM⁡n≤N{F(n)}).\psi_F(N)=\log\left(\mathop{\operatorname{LCM}}_{n\leq N}\left\lbrace F(n)\right\rbrace\right).

Let CkC_k be the conjectural constants for representations kp=x2+y2+1kp=x^2+y^2+1, and let

L=12∏p≡3 mod 4(1−1p2)−1/2.L=\frac{1}{\sqrt{2}}\prod_{p\equiv3\bmod4}\left(1-\frac{1}{p^2}\right)^{-1/2}.

The conjecture for ψF\psi_F. One should have

ψF(N)∼cFNlog⁡log⁡Nlog⁡N,\psi_F(N)\sim c_F\frac{N\log\log N}{\sqrt{\log N}},

where

cF=lim⁡N→∞1log⁡N∑k≤NCk=L≈0.76422… .c_F=\lim_{N\to\infty}\frac{1}{\log N}\sum_{k\leq N}C_k=L\approx0.76422\dots.

The paper proves the order of magnitude Nlog⁡log⁡N/log⁡NN\log\log N/\sqrt{\log N} under its hypotheses, but precise asymptotics and the displayed constant are beyond the methods used; this prediction depends on the preceding conjectures.

References

Primary source

Noam Kimmel, “The Least Common Multiple of a Bivariate Quadratic Sequence”, arXiv:2206.05817 (2023).

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.