 Another more asymptotically efficient sieving method for the same problem is the sieve of Atkin.In advanced mathematics, sieve theory applies similar methods to other problems.Some of the fastest modern tests for whether an arbitrary given number formula_1 is prime are probabilistic (or Monte Carlo) algorithms, meaning that they have a small random chance of producing an incorrect answer.