Unlike the others, this generator is purposely slow, so you can see the prime numbers as it finds them. Also, there is the function to go on forever (an unexplainable glitch forced me to remove it from the other two generators) Here is the fastest of the three: Link: https://scratch.mit.edu/projects/421643120/ The generator will go on forever unless you set a limit. You can set a limit by pressing the "Set A Limit" button. From there, type in the number the generator will stop at. When it does stop, it will review every prime number it found. Note: With the limit feature, afterwards, it may not work correctly and just keep going on and on.
The generator will make a negative sound if the number it is checking is not a prime number. If it finds a prime number, it will make a more positive sound. You'll know it when you hear it. Also, it will tell you if the number is prime or not. Credits Whoever made the concept of prime numbers Scratch, for I would not be coding this project without its simple coding language
