putnam-v1 / putnam-1967-b5

putnam-1967-b5

open

difficulty 4

credited

Run this goal:./swarm/run.sh --goal putnam-1967-b5

What it runs

The Lean statement the swarm must prove — kernel-verified at Gate A. The trailing sorry is the open obligation a proof replaces.

goals/putnam-1967-b5.lean

import Mathlib

open Nat Topology Filter

theorem putnam_1967_b5 (n : ℕ)
(hn : n > 0)
: (1 : ℚ)/2 = ∑ i ∈ Finset.range n, (Nat.choose (n + i - 1) i) * (2 : ℚ)^(-(n : ℤ) - i) := by
  sorry

Runs (0)

No runs recorded for this suite yet — they appear here as the swarm attempts the benchmarks.