ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let RNR_N be the quantity defined in the paper, let g(N)=RN/2g(N)=\sqrt{R_N/2}, and let NkN_k and Q2k+1Q_{2k+1} be the sequences defined above. Write PQ⁡j(g)\operatorname{PQ}_j(g) for the jj-th partial quotient in the continued fraction of gg. The formal continued fraction of g(N)g(N) is

g(N)=[0; 2N+1, 4N+2, ⌊12N+619⌋, …],g(N)=\Bigl[0;\,2N+1,\,4N+2,\,\Bigl\lfloor\frac{12N+6}{19}\Bigr\rfloor,\,\ldots\Bigr],

with quasi-polynomial partial quotients of periods 1,1,19,…1,1,19,\ldots. In particular, at N=NkN=N_k, the quasi-polynomial continued-fraction conjecture.

PQ⁡1(g)∣Nk=2Nk+1=Q2k+1,PQ⁡2(g)∣Nk=4Nk+2=2Q2k+1.\operatorname{PQ}_1(g)\big|_{N_k}=2N_k+1=Q_{2k+1},\qquad \operatorname{PQ}_2(g)\big|_{N_k}=4N_k+2=2Q_{2k+1}.

This pattern is suggested by the formal Euler–Maclaurin and Euclidean continued-fraction calculations. Unlike the six partial quotients established in the paper's main theorem, it is not rigorously established at the smallest indices; the corresponding formal statement remains an open problem in the accompanying Lean development.

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.