A circle is covered by random arcs with a given length a and endpoints chosen (independently and uniformly) among m equispaced points on the circle. The asymptotic distribution as a⇒0 and m←• of the number of arcs required for complete coverage is given. The result connects earlier results for the cases ma=1 (a discrete problem) and m=• (the continuous limiting case).
