AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

Collatz Problem

From AoPSWiki

Revision as of 15:22, 15 February 2009 by 1=2 (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Define the following function on \mathbb{N}: 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 n, 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.

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/Collatz_Problem"
Looking for a challenging algebra text? Preparing for MATHCOUNTS or the AMC exams?
Check out Art of Problem Solving's Introduction to Algebra by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us