AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
Personal tools

Collatz Problem

From AoPSWiki

Define the following function on : f(n)=\begin{cases} 3n+1 & 2\nmid n, \\ \frac{n}{2} & 2\mid n.\end{cases} The Collatz conjecture says that, for any positive integer , the sequence \{n,f(n),f(f(n)),f(f(f(n))),\ldots\} contains 1. This conjecture is still open. Some people have described it as the easiest unsolved problem in mathematics.


This article has been found by the AoPSWiki Editors not to be written in wiki style. Help us out by putting this page in wiki style and removing this message.

Add a glimpse of the Art of Problem Solving Forum to your own site!
Click here for details!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us