A generalization of primitive sets and a conjecture of Erd\H{o}s

DOI10.19086/da.17290zbMath1472.11077arXiv2003.12166OpenAlexW3098789501MaRDI QIDQ5126779

Jared Duker Lichtman, Tsz Ho Chan, Carl B. Pomerance

Publication date: 20 October 2020

Published in: discrete Analysis (Search for Journal in Brave)

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

zbMATH Keywords

primitive sequenceprimitive set

Mathematics Subject Classification ID

Extremal set theory (05D05) Other combinatorial number theory (11B75) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

On the critical exponent for \(k\)-primitive sets ⋮ A proof of the Erdős primitive set conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• On sets of integers, none of which divides the product of \(k\) others
• On a problem of Erdős on integers, none of which divides the product of \(k\) others
• Multiplicative bases and an Erdős problem
• Approximate formulas for some functions of prime numbers
• On the integers having exactly \(k\) prime factors
• The Erdős conjecture for primitive sets
• Optimal primitive sets with restricted primes
• On An Extremal Problem Concerning Primitive Sequences
• Note on Sequences of Integers No One of Which is Divisible By Any Other

This page was built for publication: A generalization of primitive sets and a conjecture of Erd\H{o}s