On the counting function of primitive sets of integers.

DOI10.1006/jnth.1999.2427zbMath1049.11102OpenAlexW2009830994MaRDI QIDQ1970612

Levon H. Khachatrian, Rudolf Ahlswede, András Sárközy

Publication date: 7 June 2000

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f56bb53a78739d919cfa38429a7d0696f71a2bc3

zbMATH Keywords

primitive setsnormal number of prime factorsBesicovitch constructionSathe-Selberg sieve

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Applications of sieve methods (11N36) Distribution of integers with specified multiplicative constraints (11N25) Rate of growth of arithmetic functions (11N56)

Related Items

The fiber dimension of a graph ⋮ On the size of primitive sets in function fields

Cites Work

• On the density of certain sequences of integers
• On a theorem of Behrend
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item