Generation of rational numbers by probabilistic contact $\pi$-networksстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 28 мая 2015 г.
Аннотация:The problem whether sets of rational numbers of the form 0 < m/p_1^n(1) ... p_k^n(k) < 1, where p_1,...,p_k are prime numbers, n_i >= 0 for all i = 1,...,k and k >= 2, are finitely generated by probabilistic contact \pi-networks is considered. In particular, concrete finite subsets generating these sets are described and upper bounds for the complexity of generation of numbers from these sets by the subsets are obtained.