Аннотация:A problem of rational numbers generation by probabilistic $\pi$-nets is considered. The particular number systems are given that generate the sets G[p1; -; pk] where k?2, and the upper estimates of complexity on number generation from the given sets by these number systems are indicated.