Primitive sets with large counting functions

DOI10.5486/PMD.2011.5051MaRDI QIDQ2898855zbMATH OpenFDO

Authors Greg Martin, Carl Pomerance

Publication date 12 July 2012

Published in Publicationes Mathematicae Debrecen (Search for Journal in Brave)

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

zbMATH Keywords

primitive setssequences and sets

Mathematics Subject Classification ID

Density, gaps, topology (11B05) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Abstract: A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S(x)$ is the number of elements of $S$ not exceeding $x$, then a result of ErdH os implies that $in{t}_2^{i}nfty(S(t)/t^{2}logt)dt$ converges. We establish an approximate converse to this theorem, showing that if $F$ satisfies some mild conditions and $in{t}_2^{i}nfty(F(t)/t^{2}logt)dt$ converges, then there exists a primitive set $S$ with $S(x)ggF(x)$.

Recommendations

• On the counting function of primitive sets of integers.
• A generalization of primitive sets and a conjecture of Erdős
• Sums over primitive sets with a fixed number of prime factors
• On the size of primitive sets in function fields
• Translated sums of primitive sets

Cited in

(14)

• On the counting function of primitive sets of integers.
• On the size of primitive sets in function fields
• On the Erdős primitive set conjecture in function fields
• The counting version of a problem of Erdős
• Counting primitive subsets and other statistics of the divisor graph of \(\{1,2,\dots,n\}\)
• scientific article; zbMATH DE number 981689 (Why is no real title available?)
• On Erdős and Sárközy's sequences with Property P
• Primitive and geometric-progression-free sets without large gaps
• On the n-th element of a set of positive integers
• A Cameron and Erdős conjecture on counting primitive sets
• Optimal primitive sets with restricted primes
• scientific article; zbMATH DE number 3331634 (Why is no real title available?)
• The number of maximum primitive sets of integers
• Sparse sets that satisfy the prime number theorem

This page was built for publication: Primitive sets with large counting functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898855)