 Although the problem is not known to be in NC, parallel algorithms asymptotically faster than the Euclidean algorithm exist; the fastest known deterministic algorithm is by Chor and Goldreich, which (in the CRCW-PRAM model) can solve the problem in time with processors.Randomized algorithms can solve the problem in time on formula_24 processors (this is superpolynomial).In 1972, James E. Nymann showed that "k" integers, chosen independently and uniformly from {1, ..., "n"}, are coprime with probability 1/"ζ"("k") as "n" goes to infinity, where "ζ" refers to the Riemann zeta function.