The present paper considers a discrete analog of the parking problem. Let n be an integer. If > 1, then we randomly locate interval (t, t + 1) with integer endpoints on segment [0, n]. Thus, original is divided into two: t] and [t n], each them further considered separately likewise one. phrase “randomly” in this problem means that uniformly distributed set {1, . , − 1} random variable. process...