ErdosProblems · research solved · AMS 11

hardknown result, no worker yet

Erdős Problem 690

Theorem 690 · Erdős

Let dk(p)d_k(p) be the density of those integers whose kkth smallest prime factor is pp (i.e. if p1<p2<⋯p_1<p_2<\cdots are the primes dividing nn then pk=pp_k=p).

For fixed k≥1k\geq 1 is dk(p)d_k(p) unimodular in pp? That is, it first increases in pp until its maximum then decreases.

The answer is no in general: Cambie [Ca25] has shown that dk(p)d_k(p) is unimodular for 1≤k≤31\leq k\leq 3 and is not unimodular for 4≤k≤204\leq k\leq 20.

The densities dk(p)d_k(p) 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
  sorry

Proof. sorry

Nobody has tried yet.

Reference ↗ · Lean source ↗