This algorithm uses simple operations (addition, multiplication, exponentiation, and modular congruences) to determine if a number is weakly prime, making it much more efficient. Note one should use ...

Here's an interesting prime number generator that I created. It avoids multiplication and modulo arithmetic. It does not sieve a preallocated set of integers (ex. find all primes up to N). You can ...