ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Define f:Z>0→Z>0f:\mathbb{Z}_{>0}\to\mathbb{Z}_{>0} by

f(n)={n/2,n≡0(mod2),3n+1,n≡1(mod2),f(n)=\begin{cases} n/2, & n\equiv 0 \pmod 2,\\ 3n+1, & n\equiv 1 \pmod 2,\end{cases}

and for each n∈Z>0n\in\mathbb{Z}_{>0} let a0=na_0=n and ai=f(ai−1)a_i=f(a_{i-1}) for i≥1i\ge 1, so that ai=f i(n)a_i=f^{\,i}(n) is the ii-th iterate of ff at nn.

For every n∈Z>0n\in\mathbb{Z}_{>0} there exists an integer i≥0i\ge 0 with

ai=1.a_i=1 .

Equivalently, with g:Z>0→Z>0g:\mathbb{Z}_{>0}\to\mathbb{Z}_{>0} the shortcut map

g(n)={n2,n≡0(mod2),3n+12,n≡1(mod2),g(n)=\begin{cases} \dfrac{n}{2}, & n\equiv 0 \pmod 2,\\[4pt] \dfrac{3n+1}{2}, & n\equiv 1 \pmod 2,\end{cases}

every orbit {g i(n)}i≥0\{g^{\,i}(n)\}_{i\ge 0} is bounded, and the only finite sequence (a0,a1,…,aq)(a_0,a_1,\dots,a_q) of pairwise distinct positive integers with g(aj)=aj+1g(a_j)=a_{j+1} for 0≤j<q0\le j<q and g(aq)=a0g(a_q)=a_0 is (1,2)(1,2) up to cyclic rotation.

Record

Added
Links

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.