Distribution of the number of nonappearing lengths of cycles in a random mapping

One-to-one random mappings of the set 1, 2,..., n onto itself are considered. Limit theorems are proved for the quantities _i, 0in, max _i, min _i, where _i is the number of 0in components of the vector (₁, ₂,..., _n) which are equal to i, 0< i< n, and ar is the number of components of dimension r of the random mapping.Translated from Matematicheskle Zametki, Vol. 23, No. 6, pp. 895–898, June, 1978.The author is grateful to V. P. Chistyakov and V. E. Stepanov for many useful remarks.