Created for the Pennsylvania Junior Academy of Science, 2013. For this project I implemented the above algorithms to find every prime number up to a certain limit and tested their runtimes. Use these ...

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 ...