Vladimir Blinovsky - Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes

dmtcs:3453 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3453
Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primesArticle

Authors: Vladimir Blinovsky 1

  • 1 Fakultät für Mathematik = Faculty of Mathematics [Bielefeld]

We find the formula for the cardinality of maximal set of integers from $[1,\ldots,n]$ which does not contain $k+1$ pairwise coprimes and has divisors from a specified set of primes. This formula is defined by the set of multiples of the generating set, which does not depend on $n$.

https://doi.org/10.46298/dmtcs.3453
Source: HAL:hal-01184442v1
Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: greatest common divisor,coprimes,squarefree numbers,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]

Share and export

Consultation statistics

This page has been seen 158 times.
This article's PDF has been downloaded 314 times.