Delphi.science

Erdős Problem 393: f(n) tends to infinity, assuming the abc conjecture

Daniel Veljjanoski

Palomar Registrypalomar/PALOMAR-2026-11-02-000011Nov 2, 2026math.NTscore 0

Let f(n) be the least m >= 1 such that n! = a_1 ... a_t with a_1 = n!. It does not assume Luca's theorem; only the reduction from f(n) to these polynomials is specific to Problem 393.

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-02-000011
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-02-000011/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-02-000011/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'