ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ⌊x⌋\lfloor x\rfloor be the largest integer less than or equal to xx, and let frac⁡(x)=x−⌊x⌋\operatorname{frac}(x)=x-\lfloor x\rfloor for x∈Rx\in\mathbb R. Define

Δ(x)={x2if frac⁡(x)<12,3x+12if frac⁡(x)≥12.\Delta(x)=\begin{cases}\frac{x}{2}&\text{if }\operatorname{frac}(x)<\frac12,\\[4px]\frac{3x+1}{2}&\text{if }\operatorname{frac}(x)\geq\frac12.\end{cases}

For a seed u0∈Ru_0\in\mathbb R, define its Δ\Delta-sequence by un=Δn(u0)u_n=\Delta^n(u_0).

The fractional 3n+13n+1 conjecture. Iterating Δ\Delta will eventually either converge to zero, or loop over sequences of real numbers whose successive integer parts are

1,2,4,7,11,18,9,4,7,3,5,9,4,7,11,18,9,4,7,3,6,3,1,2,4,7,3,6,3,…1,2,4,7,11,18,9,4,7,3,5,9,4,7,11,18,9,4,7,3,6,3,1,2,4,7,3,6,3,\dotsc

This cycle has length 2929.

The conjecture is a real-valued analogue of the classical Collatz problem. The authors prove it for u0∈[0,100]u_0\in[0,100] and state that extending the proof to larger fixed values appears to require increased computational power; a complete proof or refutation remains unresolved.

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.