Please check out our gofundme page!
I recently made a Facebook post on the Scientific American article New Take on an Ancient Method Improves Way to Find Prime Numbers. The article focused on a mathematicians work in improving the Sieve of Eratosthenes to determine if a number is prime. If you are unfamiliar with this ancient algorithm, then this video will be instructive:
Anyway, this got me into thinking of developing a prime number checking program – but in the opposite direction: using the most basic algorithm to check if a sequence of numbers is prime.
Sounds crazy, right? Well, just hear me out. What I want to do is to develop a cool demonstration that shows each number being tested (the speed of program execution will be a variable, btw), and the result of the testing – whether the number is prime or composite.
*** More on this later!! ***
Tags: prime numbers demo