navbar-top.gif
btn_spacer.gifHomeTopicsLatestRandomAboutFAQsParticipateAuthoring Areabtn_spacer.gif

The 3n+1 Problem

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.
Powered by Wolfram Mathematica
Contact The Wolfram Demonstrations Project Team    Site Index    Wolfram Research
©  2008 The Wolfram Demonstrations Project & Contributors    Terms of Use    Privacy Policy    RSS    Atom