Erdős Problem #1203
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1203 has maintained status OPEN — DOMAIN NORMALIZATION REQUIRED at this audit.
Let \(\omega(m)\) count distinct prime divisors. Erdős asks whether
The domain over which the maximum is taken is omitted; \(k=1\) is undefined because \(\log1=0\), and for \(k=2\), \(\log\log2<0\). The meaningful study should restrict to integers \(k\ge3\) (or larger) and source-verify whether max or supremum is intended. Because large \(k\) may dominate, maximizing over a bounded finite window does not compute actual \(F(n)\).
A small example
The deterministic fixture computes the partial maxima for \(3\le k\le100\) at \(n=100,1000,10000\), obtaining respectively approximately 1.103145926829, 1.465002343568, and 1.811078443497. Exact \(\omega(n+k)\) values are calculated by trial factorization and only the logarithmic ratios are floating-point approximations. These numbers are lower bounds on \(F(n)\) for each sampled \(n\), not the full maximum, and cannot prove \(F(n)\to\infty\).
What is known
The maintained source https://www.erdosproblems.com/1203 lists OPEN, Erdős [Er80,p.107]. Erdős reports the lower estimate \(F(n)\ge1-o(1)\), not unbounded growth; related questions #248,#679,#890 concern concentrations of prime factors in shifts. One can construct integers with many distinct prime divisors by congruence methods, but controlling the size of the positive shift relative to its maximal divisor count and proving a lower bound diverging uniformly in \(n\) is the actual obligation.
GCL's current state
Authenticated original issue-bound research return. The bounded mathematical fixture was independently replayed through ci/erdos_compendium_007_phase24_checks.py. All external advanced/general theorem statements remain attributed to sources, not independently certified. This is a local UNACCEPTED editorial manuscript.
What remains
Read Er80 original range of \(k\) and formal-conjectures statement to lock \(\max\) versus \(\sup\), the \(k=1,2\) exclusion and any implicit \(k<n\) restriction. Seek a constructive uniform-in‑\(n\) lower bound using simultaneous congruences and a quantitative upper bound on the shifts, without replacing a required divergence proof by finite computation.
Independent source fidelity and critical mathematical review, protected publication, actual public deployment and V2 admission remain separate uncompleted obligations.
Sources and claim boundaries
https://www.erdosproblems.com/1203 ; [Er80,p.107], related #248,#679,#890.
Exact finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE24.json. Original source issue frozen SHA retained; no independent certificate claimed.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2474 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.