Do you want to test if a number is prime or not? Are you trying to memorize primes for some reason? Ask the Prime Machine whether a number is prime or not! Using modulos, floors, and square roots, it can test if a number is prime! It may take a while for very large numbers, however. (However, give it a few minutes if it is about a trillion.)
Do you want to know how it works but can't make sense of all of the blocks? Here's how it works: There is an invisible list and an invisible variable. It talks to you for 5 seconds, and then asks for a number. When you give it the number, it is put into "Your Number" in the top left of the screen. Using the variable and repeated addition by 1, it puts all of the numbers up to the floor of the square root of the answer (any number above the floor of the square root of the answer is unnecessary to divide by.) It then broadcasts a signal. (I'm not sure if this is necessary, but I still used it.) When it receives this signal, it starts checking - is your number divisible by floor(sqrt(number)))? (I won't delve into how this works for now, but maybe in the project.) If it is not, it deletes the last item in the list and continues. If it is, it says "Not Prime!" After it goes down to 2, if it still hasn't worked, it says, "Prime!"
