ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let dd be a square-free positive integer. The notation o(d)o(\sqrt d) means a quantity whose ratio to d\sqrt d tends to zero as dd tends to infinity, and c=(1+o(1))dc=(1+o(1))\sqrt d means that c/dc/\sqrt d tends to 11. Divisor approximation conjecture. For any square-free positive integer dd there exist aa and cc such that

a=o(d),c=(1+o(1))d,a=o(\sqrt d),\qquad c=(1+o(1))\sqrt d,

and c∣d−a2c\mid d-a^2 when d≡2d\equiv2 or 3(mod4)3\pmod 4, while cc is even and 2c∣d−a22c\mid d-a^2 when d≡1(mod4)d\equiv1\pmod4. This is presented as an equivalent formulation of the limit conjecture, with computational verification over the ranges reported in the paper.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.