ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D2={N=pq∣p≡q≡1(mod4)}\mathcal{D}_2 = \{N=pq \mid p \equiv q \equiv 1 \pmod{4}\}, and let τ\tau denote the period of the continued fraction expansion of N\sqrt{N}. Define

D2−={N∈D2∣τ≡1(mod2)},\mathcal{D}_2^{-} = \{N \in \mathcal{D}_2 \mid \tau \equiv 1 \pmod{2}\},

and, for X>0X>0,

(D2)≤X={N∈D2∣N≤X},(D2−)≤X={N∈D2−∣N≤X}.(\mathcal{D}_2)_{\le X}=\{N\in\mathcal{D}_2\mid N\le X\},\qquad (\mathcal{D}_2^{-})_{\le X}=\{N\in\mathcal{D}_2^{-}\mid N\le X\}.

Stevenhagen's conjecture. The following limit exists and equals 23\frac{2}{3}:

lim⁡X→∞#(D2−)≤X#(D2)≤X=23.\lim_{X\rightarrow\infty}\frac{\#(\mathcal{D}_2^{-})_{\le X}}{\#(\mathcal{D}_2)_{\le X}}=\frac{2}{3}.

This is the restriction to integers with exactly two prime factors of a broader conjectural distribution for the parity of continued-fraction periods. The preceding propositions give sufficient, but not necessary, conditions for odd or even period, so determining the limiting proportion remains open in this setting.

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.