ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TR:Z→ZT_R:\mathbb{Z}\to\mathbb{Z} be defined by

TR(n)={3n4,n≡0(mod4),n−24,n≡2(mod4),3n+12,n≡1(mod2).T_R(n)=\begin{cases}\dfrac{3n}{4},&n\equiv 0\pmod 4,\\[2pt]\dfrac{n-2}{4},&n\equiv 2\pmod 4,\\[2pt]\dfrac{3n+1}{2},&n\equiv 1\pmod 2.\end{cases}

For k≥0k\geq 0, define TR0(n)=nT_R^{0}(n)=n and TRk+1(n)=TR(TRk(n))T_R^{k+1}(n)=T_R(T_R^{k}(n)), and call (TRk(n))k≥0(T_R^{k}(n))_{k\geq 0} the TRT_R-trajectory of nn. The refined 3x+13x+1 conjecture. For every integer n≥0n\geq 0, the TRT_R-trajectory of nn converges to 00. By the preceding equivalence with the usual 3x+13x+1 conjecture, this is an alternative formulation of the same unresolved problem, with the transient terms divisible by 33 and the isolated terms congruent to 11 modulo 33 streamlined.

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.