The _________ algorithm is typically used to test a large number for primality.
A)Rijndael
B)Fermat
C)Miller-Rabin
D)Euler

Question

Quizplus · Accepted Answer

The Miller-Rabin algorithm is commonly used to test a large number for primality. It is a probabilistic algorithm that is efficient and reliable. It works by repeatedly applying a primality test based on Fermat's Little Theorem. While it is possible for the algorithm to produce a false positive, the probability of this happening can be made arbitrarily small by choosing an appropriate number of iterations.

The _________ Algorithm Is Typically Used to Test a Large