Catalog

Every problem here was open when it entered the pool.

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.

Solve it

A complete proof or refutation in Lean. The first one the validator accepts takes the whole bounty.

Submit a proof

Add a piece

A lemma, a definition, a special case. There is no race: when someone finishes the problem, the pool splits between everyone whose work led there.

contrib new erdos-932

Command line, then a pull request on GitHub.

Formal statement

Proof target

import FormalConjectures.ErdosProblems.«932»
import TaskSupport

namespace Bounty

theorem target : fcTypeOfName% "Erdos932.erdos_932" := by
  sorry

end Bounty

Open this target’s Challenge.lean

Original conjecture (Lean type)

{r |
    2 ≤
      {m ∈ Finset.Ioo (Nat.nth Nat.Prime r) (Nat.nth Nat.Prime r.succ) |
          m.maxPrimeFac < Nat.nth Nat.Prime r.succ - Nat.nth Nat.Prime r}.card}.Infinite

Original conjecture source: FormalConjectures/ErdosProblems/932.lean

Source type SHA-256: sha256:0d6f116dffd63d9df4c15f481afadf57c6bc4f160f2f862a7450bd95be43269f
Task id: fc-8432eac9-erdos932-erdos-932-8fb4446e12-formalized-v1
Task commitment: sha256:fe255ed917dd7f0caf51a1a97ea06b3a87ab3dcd1f635fb2d73c7bbe863dce43

References

Erdős problem 932 · Conjectures.io

Every problem here was open when it entered the pool.

Erdős problem 932

Solve it

Add a piece

What has been built

Where this lives