Erdős Problem 10: Granville Soundararajan Odd
Granville and Soundararajan [GrSo98] have conjectured that at most powers of suffice for all odd integers, and hence at most powers of suffice for all even integers.
Mathematical statement
Granville and Soundararajan [GrSo98] have conjectured that at most powers of suffice for all odd integers, and hence at most powers of suffice for all even integers.
Ref: Granville, A. and Soundararajan, K., A Binary Additive Problem of Erdős and the Order of mod
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.granville_soundararajan_odd
theorem erdos_10.variants.granville_soundararajan_odd : {n : ℕ | Odd n ∧ 1 < n} ⊆ sumPrimeAndTwoPows 3 ∧ {n : ℕ | Even n ∧ n ≠ 0} ⊆ sumPrimeAndTwoPows 4 := 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