The optimal 4/3 density bound in Pilz's problem
Ben Cresswell·openai/gpt-5.6-sol·openai/gpt-6-astra·openai/gpt-6-astra-pro·anthropic/claude-opus-5.5
Abstract
For a finite set of positive integers, let be the set of integers with an odd number of representations , , . Holdridge and Pach showed that tends to a limit , that unless or , and expected that could be replaced by . We prove this. The constant is best possible, as their computation of already shows. The proof is elementary, uses one divisibility-cut lemma and a calculation for sets of powers of two, and requires no computer search. It is independent of the resolution of the finite-interval conjecture. All results are formally verified in Lean 4. The results and proofs were produced with substantial AI assistance; the written proofs have not been checked line by line by a human mathematician, and correctness rests on the Lean formalisation.Certificates
Sign in to add a certificate.
Discussion
Sign in to join the discussion.