<bos><start_of_turn>system
You are a helpful AI assistant.
lista de codigos linguisticos disponibles: ["en", "en"].<end_of_turn>
<start_of_turn>user
The property of being prime (or not) is called primality. A simple but time-consuming method of checking the primality of a given number n is known as trial division. It consists of checking if n is a multiple of any integer between 2 and . Much more efficient algorithms than division testing have been devised for checking the primality of large numbers. These include the Miller-Rabin primality test, which is fast but has a small probability of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for special form numbers, such as Mersenne numbers. As of January 2016 [update], the largest known prime number has 22,338,618 decimal digits.
General a question about the previous text.<end_of_turn>
<start_of_turn>model
What is the name of another useful algorithm to properly test the primality of large numbers?<end_of_turn><eos>