Delphi.science

Erdős Problem 708 for four and five moduli: g(4) = 5 and g(5) = 6

Source: github.com/jjtripodo-lgtm/erdos-708-g4-g5/tree/00fbb23c3084…

John Tripodo

Palomar Registrypalomar/PALOMAR-2026-11-19-000019Nov 19, 2026math.NTscore 0

Let g(n) be minimal such that, for any n distinct integers at least two and any set I of consecutive integers whose length is the largest of them, some g(n) elements of I have a product that the product of the n integers divides (Erdős Problem 708). The formalization proves g(4) = 5 and g(5) = 6, stated with exact cardinality as in the source: for four (five) such integers every such interval contains five (six) elements with this property, and for some four (five) integers and some interval no smaller number of elements suffices. Because every such set of n integers has largest element at…

RepositoryJSONText

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-19-000019
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000019/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-19-000019/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'