putnam-v1 / putnam-1964-b5

putnam-1964-b5

open

difficulty 4

credited

Run this goal:./swarm/run.sh --goal putnam-1964-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-1964-b5.lean

import Mathlib

open Set Function Filter Topology

theorem putnam_1964_b5 (a b : ℕ → ℕ)
(ha : StrictMono a ∧ ∀ n : ℕ, a n > 0)
(hb : b 0 = a 0 ∧ ∀ n : ℕ, b (n + 1) = lcm (b n) (a (n + 1)))
: (∃ L : ℝ, Tendsto (fun N ↦ ∑ n ∈ Finset.range N, (1 : ℝ) / b n) atTop (𝓝 L)) := by
  sorry

Runs (0)

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