Difference between revisions of "Collatz Problem"
(category) |
(space) |
||
| Line 1: | Line 1: | ||
Define the following [[function]] on <math>\mathbb{N}</math>: <math>f(n)=\begin{cases} 3n+1 & 2\nmid n, \\ \frac{n}{2} & 2\mid n.\end{cases}</math> The Collatz conjecture says that, for any [[positive integer]] <math>n</math>, the sequence <math>\{n,f(n),f(f(n)),f(f(f(n))),\ldots\}</math> contains 1. This conjecture is still open. Some people have described it as the easiest unsolved problem in mathematics. | Define the following [[function]] on <math>\mathbb{N}</math>: <math>f(n)=\begin{cases} 3n+1 & 2\nmid n, \\ \frac{n}{2} & 2\mid n.\end{cases}</math> The Collatz conjecture says that, for any [[positive integer]] <math>n</math>, the sequence <math>\{n,f(n),f(f(n)),f(f(f(n))),\ldots\}</math> contains 1. This conjecture is still open. Some people have described it as the easiest unsolved problem in mathematics. | ||
| + | |||
{{wikify}} | {{wikify}} | ||
[[Category:Number theory]] | [[Category:Number theory]] | ||
Revision as of 21:04, 7 October 2007
Define the following function on 
: 
The Collatz conjecture says that, for any positive integer 
, the sequence 
contains 1. This conjecture is still open. Some people have described it as the easiest unsolved problem in mathematics.
