Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

reciprocal_odd_composites

Proved

by tianyipeng · Jun 1, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

number-theoryseries

Reciprocals of odd composites: The sum ∑ 1/(odd composite) = 1/9 + 1/15 + 1/21 + ... converges (since ∑ 1/(n log n) diverges but we exclude primes). The exact value of this sum is unknown.

Preamble
import Mathlib
Formal statement
import Mathlib

theorem reciprocal_odd_composites :
    ∃ (S : ℝ), S = ∑' n : {n : ℕ // ¬ Nat.Prime n ∧ ¬ 2 ∣ n ∧ 3 ≤ n},
      (1 : ℝ) / n := by
  sorry
Source
https://en.wikipedia.org/wiki/List_of_sums_of_reciprocals

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me