Catalog
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Number theory
V(x) count the number of n≤x such that ϕ(m)=n is solvable. Does V(2x)/V(x)→2 ?
References
No one has attempted this yet.
Prove the statementYou are here$4,7320 attempts
Bounty
$4,732
paid on an accepted proof
Set by bounty policy dynamic-age-v1: the amount is worked out from how long the problem has stood open, so it moves as the pool and the pool's age profile move.
Your file is checked for free before any credit is spent.
Formal statement
Lean type
Filter.Tendsto (fun x => Erdos416.V (2 * x) / Erdos416.V x) Filter.atTop (nhds 2)What you must prove
import FormalConjectures.ErdosProblems.«416»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Erdos416.erdos_416.parts.i" := by
sorry
end Bounty
Pinned source: FormalConjectures/ErdosProblems/416.lean
Something wrong with this formalization?
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.