ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (an)(a_n) be the recursively defined sequence considered in the paper. For positive integers xx and mm, let dx,md_{x,m} denote the limiting density of indices nn for which an≡x(modm)a_n\equiv x\pmod m. Density conjecture. If xx and mm are positive integers and 3232 does not divide mm, then the limit dx,md_{x,m} exists and equals

dx,m={1mif⁡m≡1(mod2)23mif⁡x≡0(mod2)and⁡m≡2(mod4)43mif⁡x≡1(mod2)and⁡m≡2(mod4)43mif⁡x≢m≡0(mod4)0if⁡x≡m≡0(mod4)d_{x,m}=\begin{cases} \frac{1}{m} & \operatorname{if} m\equiv 1\pmod{2} \\ \frac{2}{3m} & \operatorname{if} x\equiv 0\pmod{2}\operatorname{and} m\equiv 2\pmod{4} \\ \frac{4}{3m} & \operatorname{if} x\equiv 1\pmod{2}\operatorname{and} m\equiv 2\pmod{4} \\ \frac{4}{3m} & \operatorname{if} x\not\equiv m\equiv 0\pmod{4} \\ 0 & \operatorname{if} x\equiv m\equiv 0\pmod{4} \end{cases}

The conjecture proposes a complete formula for the residue-class densities whenever mm is not a multiple of 3232. The paper notes that the analogous question for multiples of 3232, particularly m=32m=32 and odd xx, is not settled and that the displayed formula is motivated by computation and theorems establishing lower bounds.

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.