A proof of the Erdős primitive set conjecture

DOI10.1017/fmp.2023.16arXiv2202.02384OpenAlexW4379961473WikidataQ123353019 ScholiaQ123353019MaRDI QIDQ6106959

Jared Duker Lichtman

Publication date: 3 July 2023

Published in: Forum of Mathematics, Pi (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.02384

zbMATH Keywords

antichainprimitive setdivisor lattice

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Distribution of primes (11N05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• On the size of primitive sets in function fields
• Translated sums of primitive sets
• On the Erdős primitive set conjecture in function fields
• Almost primes and the Banks-Martin conjecture
• Translated sum on primitive sequences and Erdős conjecture
• Approximate formulas for some functions of prime numbers
• On the critical exponent for \(k\)-primitive sets
• Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
• The Erdős conjecture for primitive sets
• Chebyshev's Bias
• A generalization of primitive sets and a conjecture of Erd\H{o}s
• Sums over primitive sets with a fixed number of prime factors
• Primes in prime number races
• On a Problem of Erdos Concerning Primitive Sequences
• Optimal primitive sets with restricted primes
• On the divisibility properties of sequences of integers (II)
• On Sequences of Numbers not Divisible one by another
• A Generalization of a Theorem of Besicovitch
• On sequences of positive integers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A proof of the Erdős primitive set conjecture