Offer 01€300Ingo Althöfer
Personal offerFirst solution wins; computer-assisted proofs are allowed, the sponsor excludes legal recourse, and the offer expires on 31 December 2037.
Permanent problem IDPPL 004
Dynamical systems
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.
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.
First solution wins; computer-assisted proofs are allowed, the sponsor excludes legal recourse, and the offer expires on 31 December 2037.