The 3n+1 Problem
Initializing live version
Requires a Wolfram Notebook System
Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.
Start with a number. Then at each step, if is even, compute , and if is odd, compute . So far as anyone can tell, the resulting sequence always eventually reaches 1. But despite work since the 1930s, no proof is known.
Contributed by: Stephen Wolfram (March 2011)
Open content licensed under CC BY-NC-SA