PPL 004 / 177 permanent IDsPrize Problem Ledger · PPLChecked 2026.07.27
Prize Problem LedgerAlthöfer Collatz prizesPPL 004Althöfer · Stochastic ± Collatz convergence

Permanent problem IDPPL 004

Verified openIndependentconjecture

Dynamical systems

Althöfer · Stochastic ± Collatz convergence

Starting from any odd positive integer, repeatedly choose 3n+1 or 3n−1 by a fair coin and then remove every factor of 2. Prove that the process reaches 1 almost surely.

Collatz variantsinteger iterationdiscrete dynamics
01

The problem

Starting from any odd positive integer, repeatedly choose 3n+1 or 3n−1 by a fair coin and then remove every factor of 2. Prove that the process reaches 1 almost surely.

Open since2026sponsor-stated or introduction year
Last checked2026.07.27Catalog verification
02

Reward offers

Offer 01€300Ingo Althöfer
Personal offer

First solution wins; computer-assisted proofs are allowed, the sponsor excludes legal recourse, and the offer expires on 31 December 2037.

Published deadline: 2037-12-31

03

Sources & reading