erdos-problems

A quantitative corollary of Bradač’s theorem resolving Erdős Problem 920

Stanford AI for Lean Club progress on Erdős problems: papers, frontier notes, visualizer data, and Lean formalization.

Citation-audited proof note on the Rademacher formulation of Erdős Problem #521

An exact subgroup-obstruction calculus for two-generator exponential congruence problems, with applications to Erdos-Graham #203 and a precise Kummer non-concentration criterion

Seventeen papers on Erdos-Graham 203 and Kummer non-concentration, with compiled PDFs, including a defensive publication of the routes that fail

Corrected Gaussian proof for Erdos Problem 906, with an audited Lean consumer boundary

Independent mathematical research on Erdős Problem 889: prime-power variants, Diophantine reductions and exact computation.

A new lower bound d(2,8) > 30000 for integral octagons in general position, improving the hereditary bound of 22270, with 394 impossibility certificates

Expanded verification of Chojecki's gap-greedy proof of Erdős Problem 421, with a sharpened short-gap estimate.

A combinatorial sieve lower bound for the Erdos-Graham 203 family, the Graham Z29 certificate paper, and three standalone notes. None refereed.

Graham/Alspach sequenceability dual-verified for Z_37, Z_41, Z_43, Z_61: 22,082,109 subsets of size 29-60