Skip to content
The Chat Archive
deepseek-r1-0528· DeepSeek LMArena Human Preference 140K

Give an example of an easily formulated but still unsolved mathematical problem.

  1. User

    Give an example of an easily formulated but still unsolved mathematical problem.

  2. Assistant

    Here's a classic example that is incredibly simple to state but remains famously unsolved:

    The Collatz Conjecture (also known as the 3n + 1 Problem)

    1. Start with any positive integer n.
    2. Apply the following rules repeatedly:
      • If n is even, divide it by 2: n → n / 2
      • If n is odd, multiply it by 3 and add 1: n → 3n + 1
    3. Conjecture: No matter what positive integer n you start with, this process will eventually reach the number 1.

    Why it's easily formulated:

    • It only uses basic arithmetic operations: multiplication, division, addition.
    • The rules are dead simple and unambiguous.
    • You can try it yourself with any number right now.

    Example: Start with n = 6 (even)
    6 → 3 (even? no, odd) → 3*3 + 1 = 10 (even) → 5 (odd) → 16 (even) → 8 (even) → 4 (even) → 2 (even) → 1
    Reaches 1 in 8 steps.

    Example: Start with n = 11 (odd)
    11 → 34 (even) → 17 (odd) → 52 (even) → 26 (even) → 13 (odd) → 40 (even) → 20 (even) → 10 (even) → 5 (odd) → 16 → 8 → 4 → 2 → 1
    Reaches 1 in 14 steps.

    Why it's still unsolved:

    • Verified but not Proven: Computers have verified the conjecture holds for all starting numbers up to a staggering 2⁶⁸ ≈ 295,147,905,179,352,825,856. Yet, this is not proof it holds for every positive integer.
    • Unpredictable Behavior: While the sequences always seem to reach 1 in the vast numbers tested, the path they take is highly erratic and unpredictable. The number of steps varies wildly and seemingly randomly even for close starting numbers.
    • No Known Pattern: Mathematicians haven't been able to find a deep underlying pattern or invariant that guarantees the sequence will always decrease towards 1, despite the tendency for the 3n+1 step to increase the value and the n/2 steps to decrease it.
    • Stubbornness: Despite its simplicity, it has resisted all attempts at proof for over 80 years. Many powerful mathematical techniques have been applied without success. Renowned mathematician Paul Erdős famously said about the Collatz conjecture: "Mathematics may not be ready for such problems."

    The Core Mystery: Will every single positive integer, no matter how large, eventually be reduced to 1 by repeatedly applying these two simple rules? We think so based on overwhelming experimental evidence, but no one has been able to prove it mathematically.

    The Collatz Conjecture perfectly captures the essence of mathematics: a problem that can be explained to a schoolchild, yet whose solution continues to elude the greatest mathematical minds. It demonstrates how profound complexity and mystery can arise from the simplest of rules.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.