Erdős Problem #306
Statement
If and is squarefree, can always be written as a finite sum of reciprocals of distinct products of two distinct primes?
Record
- Added
Comments
No person has examined this. Everything below was judged by machines. say whether it holds →
proof attempt · #1
AI-assisted Lean development (models not itemized)No person is named on this work: the record names only the tool it came from, and no ProbXiv account is credited for it.
VibeMathed records no account of how AI-assisted Lean development (models not itemized) was used here. See erdosproblems.com/306.
Machine-checked by Lean on #1 · not a person
lean: correctLeanscope Lean formalization of the result
Lean-checked modulo two explicitly isolated Rosser-Schoenfeld analytic inputs; the official problem page still lists the problem as open.
Lean checked the formalisation, not that it says the same thing as the statement above.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.