Erdős Problem #1144
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: number theory, probability.
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 #1144 concerns the following mathematical question and its exact quantifiers:
Choose independent fair random signs f(p) in {-1,1} at primes and extend COMPLETELY multiplicatively f(p^a)=f(p)^a. With S_N=sum_{n<=N} f(n), ask whether almost surely limsup_{N->infinity} S_N/sqrt(N)=infinity. Do not substitute squarefree-supported Rademacher f(n) or Steinhaus signs; distinguish an almost-sure lower-tail statement from moment identities.
A small example
For N=16 the six prime signs admit exactly 64 assignments. Exact enumeration yields E S_16=4 and E S_16²=32. In general E f(n)=1 if n is a perfect square and 0 otherwise, while E f(a)f(b)=1 iff ab is a perfect square. Hence E S_N=floor sqrt(N) and E S_N² counts ordered square-product pairs. These are rigorously exact moment identities, NOT a proof of almost-sure positive limsup.
What is known
https://www.erdosproblems.com/1144 remains OPEN [Va99,1.11]. Atherfold [At25] externally proved an almost-sure upper bound S_N << sqrt(N)(log N)^{1+o(1)}, which is compatible with both possible limsup outcomes. Primary 2025 paper theorem and precise random model not independently proof-reviewed.
GCL's current state
Authenticated original-issue source return established the bounded source and finite-evidence interface. The finite \(N=16\) first and second moments are exact identities, not evidence of almost-sure unbounded positive fluctuations.
All general results cited here remain external until primary-source review.
What remains
ERDOS-1144-COMPLETE-RANDOM-MULT-001: source-lock Vardi and Atherfold; check almost-sure probability quantifier, logarithmic exponents and complete vs squarefree multiplicativity, then derive and test exact second moments and any rigorous limsup lower bound without using simulations as proof.
General infinite almost-sure limsup OPEN; Atherfold source proof and hypotheses awaiting independent review.
Sources and claim boundaries
https://www.erdosproblems.com/1144 ; Vardi 1999, Atherfold 2025; exact phase17 64-assignment finite fixture; no new theorem proof.
This is a source-bound, unaccepted editorial draft. Neither protected cohort admission nor proof or Lean certification is implied.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2415 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: STATEMENT_CAPTURE_REQUIRED.
- Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.