All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsCombinatorics

Erdős Problem 10: Grechuk

Bogdan Grechuk has observed that 11171751461117175146 is not the sum of a prime and at most 33 powers of 22, and pointed out that parity considerations, coupled with the fact that there are many integers not the sum of a prime and 22 powers of 22 suggest that t...

Mathematical statement

Bogdan Grechuk has observed that 11171751461117175146 is not the sum of a prime and at most 33 powers of 22, and pointed out that parity considerations, coupled with the fact that there are many integers not the sum of a prime and 22 powers of 22 suggest that there exist infinitely many even integers which are not the sum of a prime and at most 33 powers of 22).

Statement source: Erdős Problems statement material

Statement terms: Source-specific

Source-specific terms. Therefore does not assert reuse rights beyond attributed display.

Statement artifacts, not proofs

These records expose exact Lean propositions and statement-only wrappers. Defining a proposition does not supply a proof of it. A placeholder-bearing target also contains no proof. Elaboration checks syntax and types; it does not certify that a formalization perfectly captures every nuance of the informal problem.

Pinned Lean formulation 1

erdos_10.variants.grechuk

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_10.variants.grechuk :    Set.Infinite <| {n :  | Even n} \ sumPrimeAndTwoPows 3 := by  sorry
Statement source
Formal Conjectures
Lean version
v4.27.0
Placeholder
Present; no proof artifact
Source evidence
Pinned source index
Fidelity review
Community formulation

References