The Erdős conjecture for primitive sets
From MaRDI portal
Publication:4631736
DOI10.1090/bproc/40zbMath1481.11026arXiv1806.02250OpenAlexW3105750407WikidataQ123159711 ScholiaQ123159711MaRDI QIDQ4631736
Jared Duker Lichtman, Carl B. Pomerance
Publication date: 18 April 2019
Published in: Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.02250
Special sequences and polynomials (11B83) Distribution of primes (11N05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
Related Items (10)
Translated sums of primitive sets ⋮ On the critical exponent for \(k\)-primitive sets ⋮ Analytic number theory. Abstracts from the workshop held November 6--12, 2022 ⋮ A proof of the Erdős primitive set conjecture ⋮ Coprime permutations ⋮ On the Erdős primitive set conjecture in function fields ⋮ On the size of primitive sets in function fields ⋮ A generalization of primitive sets and a conjecture of Erd\H{o}s ⋮ Almost primes and the Banks-Martin conjecture ⋮ Primes in prime number races
Cites Work
- Unnamed Item
- On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)
- On sums of primes
- The reciprocal sum of primitive nondeficient numbers
- Explicit estimates of some functions over primes
- On the density of certain sequences of integers
- Approximate formulas for some functions of prime numbers
- On the integers having exactly \(k\) prime factors
- Generalized Euler constants
- Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
- An Upper Bound of Σ1/(a i loga i ) for Primitive Sequences
- Chebyshev's Bias
- Sums over primitive sets with a fixed number of prime factors
- On a Problem of Erdos Concerning Primitive Sequences
- New estimates for the $n$th prime number
- Optimal primitive sets with restricted primes
- A bias in Mertens’ product formula
- A NEW SERIES FOR THE DENSITY OF ABUNDANT NUMBERS
This page was built for publication: The Erdős conjecture for primitive sets
