Motivated by classical nontransitivity paradoxes, we call an n-tuple (x 1 , . . . , x n ) ∈ [0, 1] n cyclic if there exist independent random variables U 1 , . . . , U n withWe call the tuple (x 1 , . . . , x n ) nontransitive if it is cyclic and in addition satisfies x i > 1/2 for all i.Let p n (resp. p * n ) denote the probability that a randomly chosen n-tuple (x 1 , . . . , x n ) ∈ [0, 1] n is cyclic (resp. nontransitive). We determine p 3 and p * 3 exactly, while for n ≥ 4 we give upper and lower bounds for p n that show that p n converges to 1 as n → ∞. We also determine the distribution of the smallest, middle, and largest elements in a cyclic triple.