brute-force primality test
nounUK /bruːt fɔːs praɪˈmæləti tɛst/
US /bruːt fɔːrs praɪˈmæləti tɛst/
A way to check if a number is prime by trying to divide it by every smaller number.
The brute-force primality test checked every number up to the square root of 97.
OTHER MEANINGS
2. A simple but slow method that tests all possible divisors instead of using shortcuts.
For small inputs, the brute-force primality test is fast enough.
3. An educational algorithm used to introduce the idea of primality checking.
Students first learn the brute-force primality test before studying probabilistic methods.
4. A baseline approach against which faster primality tests are compared.
The Miller-Rabin test is much quicker than the brute-force primality test for large numbers.