putnam-v1 / putnam-1965-a5

putnam-1965-a5

open

difficulty 4

credited

Run this goal:./swarm/run.sh --goal putnam-1965-a5

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-1965-a5.lean

import Mathlib

open EuclideanGeometry Topology Filter Complex
abbrev putnam_1965_a5_solution : ℕ → ℕ := fun n => 2^(n - 1)

theorem putnam_1965_a5 : ∀ n > 0, {p ∈ permsOfFinset (Finset.Icc 1 n) | ∀ m ∈ Finset.Icc 2 n, ∃ k ∈ Finset.Ico 1 m, p m = p k + 1 ∨ p m = p k - 1}.card = putnam_1965_a5_solution n := by
  sorry

Runs (0)

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