The Collatz Conjecture: The Simple Number Game No One Can Prove
Maya Stevens
Abstract
The Collatz Conjecture is one of the most famous unsolved problems in mathematics. What makes it surprising is that the rules are extremely simple. A student in middle school can understand and play the game: pick any positive whole number. If it is even, divide it by 2. If it is odd, multiply it by 3 and add 1. Then repeat the same steps again and again. The conjecture says that no matter which positive whole number we start with, the sequence will eventually reach 1. For example, if we start with 6, the sequence becomes 6 → 3 → 10 → 5 → 16 → 8 → 4 → 2 → 1. This works for small numbers, large numbers, and every number mathematicians have tested so far. However, no one has been able to prove that it works for all positive whole numbers. This is why the Collatz Conjecture is so interesting: it looks easy, but it is extremely difficult. This paper explains the Collatz Conjecture in simple language. It discusses the rules of the problem, gives examples, studies small-number data, and explains why the problem is still unsolved. The aim is to show that mathematics is not only about complicated formulas. Sometimes, the deepest mysteries begin with the simplest questions.
Keywords
Keywords: Collatz Conjecture, Unsolved Problem, Number Theory, Positive Whole Numbers, Even and Odd Numbers, Mathematical Sequence, 3n + 1 Problem, Iteration, Mathematical Proof.