Skip to content
The Chat Archive
Claudeclaude-opus-4-20250514-thinking-16k· Anthropic LMArena Human Preference 140K

Prove or disprove: Every number of the form 2^n + 1 is prime.

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with Qwenqwen3-235b-a22b’s answer.
  1. User

    Prove or disprove: Every number of the form 2^n + 1 is prime.

  2. Assistant

    I'll disprove this statement by providing a counterexample.

    The statement is false. Not every number of the form 2^n + 1 is prime.

    Counterexample: Let n = 3. Then 2^3 + 1 = 8 + 1 = 9 = 3 × 3

    Since 9 is composite, this disproves the statement.

    Further analysis:

    There's actually a deeper pattern here. For 2^n + 1 to have any chance of being prime, n must be a power of 2. Here's why:

    If n has an odd divisor greater than 1, then 2^n + 1 is composite. Specifically, if n = ab where a is odd and a > 1, we can use the factorization:

    x^a + 1 = (x + 1)(x^(a-1) - x^(a-2) + x^(a-3) - ... - x + 1)

    Setting x = 2^b gives us: 2^n + 1 = 2^(ab) + 1 = (2^b)^a + 1 = (2^b + 1)((2^b)^(a-1) - (2^b)^(a-2) + ... - 2^b + 1)

    Both factors are greater than 1, making 2^n + 1 composite.

    Numbers of the form 2^(2^k) + 1 are called Fermat numbers. The first five are prime:

    • F_0 = 2^1 + 1 = 3
    • F_1 = 2^2 + 1 = 5
    • F_2 = 2^4 + 1 = 17
    • F_3 = 2^8 + 1 = 257
    • F_4 = 2^16 + 1 = 65,537

    However, F_5 = 2^32 + 1 = 4,294,967,297 = 641 × 6,700,417 is composite, and no other Fermat primes have been found despite extensive searching.

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