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-1137

Command line, then a pull request on GitHub.

Formal statement

Proof target

import FormalConjectures.ErdosProblems.«1137»
import TaskSupport

namespace Bounty

theorem target : fcTypeOfName% "Erdos1137.erdos_1137" := by
  sorry

end Bounty

Open this target’s Challenge.lean

Original conjecture (Lean type)

True ↔
  Filter.Tendsto
    (fun x => ↑((Finset.range x).sup fun n => primeGap n * primeGap (n - 1)) / ↑((Finset.range x).sup primeGap) ^ 2)
    Filter.atTop (nhds 0)

Original conjecture source: FormalConjectures/ErdosProblems/1137.lean

Source type SHA-256: sha256:a62d844e5fab8e4377daba553a74aa8ae79e3a98cbf6f1b7c3031dbc18f6895d
Task id: fc-8432eac9-erdos1137-erdos-1137-a887e1b05b-formalized-v1
Task commitment: sha256:0246b46a5fc432433b67785337b6f52c94b276505c8c440d7fb5d48abc0c8838

References

Erdős problem 1137 · Conjectures.io

Every problem here was open when it entered the pool.

Erdős problem 1137

Solve it

Add a piece

What has been built

Where this lives