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-828-variants-lehmer-conjecture

Command line, then a pull request on GitHub.

Formal statement

Proof target

import FormalConjectures.ErdosProblems.«828»
import TaskSupport

namespace Bounty

theorem target : fcTypeOfName% "Erdos828.erdos_828.variants.lehmer_conjecture" := by
  sorry

end Bounty

Open this target’s Challenge.lean

Original conjecture (Lean type)

True ↔ ∀ n > 1, n.totient ∣ n - 1 ↔ Prime n

Original conjecture source: FormalConjectures/ErdosProblems/828.lean

Source type SHA-256: sha256:337ac83858d3d220844b1daf2652e936386eba74718044de14dec1b34604137f
Task id: fc-8432eac9-variants-lehmer-conjecture-50e99dd973-formalized-v1
Task commitment: sha256:8d6da6ded1e8e090ca489532d18d9cd10c14bb3b9ba4b5831003b5a80d71bfb6

References

Erdős problem 828 - lehmer conjecture · Conjectures.io

Every problem here was open when it entered the pool.

Erdős problem 828 - lehmer conjecture

Solve it

Add a piece

What has been built

Where this lives