All open problems
Source labels openChecked July 26, 2026

Erdős ProblemsNumber theory

Erdős Problem 931: Additional Condition

Erdős thought perhaps if the two products have the same factors then n2>2(n1+k1)n_2 > 2(n_1 + k_1). It is an open question whether this is true when allowing a finite number of counterexamples.

Mathematical statement

Erdős thought perhaps if the two products have the same factors then n2>2(n1+k1)n_2 > 2(n_1 + k_1). It is an open question whether this is true when allowing a finite number of counterexamples.

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_931.variants.additional_condition

Canonical source
Complete statement target, proof intentionally absentLean 4
theorem erdos_931.variants.additional_condition : answer(sorry)  ᵉ (k₁ : ) (k₂  3), k₂  k₁     {(n₁, n₂) | n₁ + k₁  n₂  n₂  2 * (n₁ + k₁)       (∏ i  Finset.Icc 1 k₁, (n₁ + i)).primeFactors =      (∏ j  Finset.Icc 1 k₂, (n₂ + j)).primeFactors}.Finite := 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