Structural properties of primitive systems of natural numbers
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 16-18
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The primitive systems of natural numbers are considered. The structure of their set is described, and the main properties of them are installed. An algorithm for enumerating primitive systems of natural numbers not exceeding a given number $m$ is given.
[1] Sachkov V. N., Tarakanov V. E., Kombinatorika neotritsatelnykh matrits, TVP, M., 2000 | MR | Zbl
[2] Fomichëv V. M., Metody diskretnoi matematiki v kriptologii, DIALOG-MIFI, M., 2010
[3] Rosser B., “The $n$-th prime is greater than $n\log n$”, Proc. London Math. Soc., 45 (1939), 21–44 | DOI | MR
[4] Kyazhin S. N., Fomichev V. M., “O primitivnykh naborakh naturalnykh chisel”, Prikladnaya diskretnaya matematika, 2012, no. 2, 5–14