ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Π\Pi be the set of positive integers relatively prime to 22 and 33. For x∈Πx\in\Pi, define the (3x+1)(3x+1)-Map MM by choosing k≥1k\geq 1 such that 2k∥(3x+1)2^k\parallel(3x+1) and setting

y=3x+12k.y=\frac{3x+1}{2^k}.

(3x+1)(3x+1)-Conjecture. For every x∈Πx\in\Pi, there is an integer nn such that

Mn(x)=1.M^n(x)=1.

This is the classical Collatz-type assertion that every positive integer in the natural domain of the odd-step map eventually reaches the fixed point 11. The source reports computational verification for all x∈Πx\in\Pi with 0<x<2600<x<2^{60}, but the universal statement remains open.

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.