Back to Problems

erdos_313_conjecture

Specification

Are there infinitely many pairs `(m, P)` where `m ≥ 2` is an integer and `P` is a set of distinct primes such that the following equation holds: $\sum_{p \in P} \frac{1}{p} = 1 - \frac{1}{m}$?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement 
theorem erdos_313_conjecture : answer(sorry) ↔ erdos_313_solutions.Infinite
ID: ErdosProblems__313__erdos_313_conjecture
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.