A divisor-closed criterion for Behrend sequences

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer ↗

Version 1 / Nov 20, 2026 / CC BY 4.0

Abstract

We give a necessary and sufficient condition for a set of positive integers to be a Behrend sequence. The condition quantifies over sequences of finite divisor-closed sets supported on consecutive prime blocks. For each element at one level, its permitted extensions at the next level retain a prescribed reciprocal mass. We prove that the set of multiples of AA has natural density one if and only if AA meets every such family. The proof combines the classical Davenport–Erdős finite-approximation theorem with a finite pruning argument for independent geometric prime valuations.

Author comments: The pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000563. Proof repository and verification records: https://github.com/Ghuffy1/erdos691

Provenance statement

The authors acknowledge OpenAI AI tools for mathematical exploration, checking, formalization, and preparation of the manuscript. The exact Lean proof and its expanded statement passed the published build and kernel replay.

References

  1. H. Davenport and P. Erdős, On sequences of positive integers , Acta Arithmetica 2 (1936), 147--151.
  2. P. Erdős, Some unconventional problems in number theory , Astérisque 61 (1979), 73--82.

Version history

  1. v1 · 6 pagesSubmitted by Liam KruerThe pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000563. Proof repository and verification records: https://github.com/Ghuffy1/erdos691CurrentNov 20, 2026