Id: palomar/PALOMAR-2026-11-19-000019 Url: https://github.com/jjtripodo-lgtm/erdos-708-g4-g5/tree/00fbb23c3084daa88ea420aa9c74177127d5283f Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000019-v1.json Repo: https://github.com/jjtripodo-lgtm/erdos-708-g4-g5 Tags: math.NT, msc:11A05, msc:11B75 Score: 0 Title: Erdős Problem 708 for four and five moduli: g(4) = 5 and g(5) = 6 Trust: high Domain: math.NT Source: palomar Authors: John Tripodo Reviews: 0 Subject: math.NT Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000019 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…