An improved upper bound on the maximum size of k-primitive sets

zbMATH Open1107.11019MaRDI QIDQ3415014FDOQ3415014

Authors: Peter Hegarty 

Publication date: 12 January 2007

Full work available at URL: https://eudml.org/doc/126974

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A generalization of primitive sets and a conjecture of Erdős
• Primitive and geometric-progression-free sets without large gaps
• On sets of integers, none of which divides the product of \(k\) others
• Upper and lower bounds on the size of \(B_k[g]\) sets
• Maximal sets of numbers not containing k+1 pairwise coprime integers

zbMATH Keywords

\(k\)-primitive sets

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cited In (3)

• A tight lower bound for primitivity in k-structures
• Title not available (Why is that?)
• Sets of prime numbers satisfying a divisibility condition

This page was built for publication: An improved upper bound on the maximum size of \(k\)-primitive sets

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