Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

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

Abstract

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$.
Fichier principal
Vignette du fichier
dmAE0165.pdf (153.92 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184442 , version 1 (17-08-2015)

Identifiers

Cite

Vladimir Blinovsky. Maximal sets of integers not containing $k+1$ pairwise coprimes and having divisors from a specified set of primes. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.335-340, ⟨10.46298/dmtcs.3453⟩. ⟨hal-01184442⟩

Collections

TDS-MACS
42 View
535 Download

Altmetric

Share

Gmail Facebook X LinkedIn More