ErdosProblems · research solved · AMS 11
hardknown result, no worker yet
Erdős Problem 690
Theorem 690 · Erdős
Let be the density of those integers whose th smallest prime factor is (i.e. if are the primes dividing then ).
For fixed is unimodular in ? That is, it first increases in until its maximum then decreases.
The answer is no in general: Cambie [Ca25] has shown that is unimodular for and is not unimodular for .
The densities exist (see erdos_690.variants.hasDensity), so the statement quantifies
over any function d recording them.
Formal statement · Lean 4.lean
theorem erdos_690 : answer(False) ↔
∀ k ≥ 1, ∀ d : ℕ → ℝ,
(∀ p, p.Prime → (kthPrimeFactorSet k p).HasDensity (d p)) → IsUnimodalOnPrimes d := by
sorryProof. sorry
Nobody has tried yet.