ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For an integer aa, let Nk(a)N_k(a) count the integers that reach aa after exactly kk iterations of the 3x+13x+1 map, and define the tree growth constant by

δ3(a):=lim sup⁡k→∞1klog⁡Nk(a).\delta_3(a):=\limsup_{k\to\infty}\frac{1}{k}\log N_k(a).

3x+1 tree growth constant conjecture. For every integer a≢0(mod3)a\not\equiv0\pmod 3,

δ3(a)=log⁡(43).\delta_3(a)=\log\left(\frac43\right).

The conjecture is motivated by the exact average size of pruned inverse trees. The source attributes it to Lagarias and Weiss and gives no resolution.

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.