First, put in turbo mode by shift-clicking the green flag. Then enter a number that you want to find the prime numbers of up to. Don't make it too large, less than 10,000 is best.
This is a prime number finder I made that can get all the prime numbers up to very large numbers. Try doing 1000 on it and it won't take very long. Put it in turbo mode and it gets 1000 instantly, and 30,000 in only about a minute. Rather than going through every number 1 by 1 and testing if it is prime or not, it gets all the numbers that are not prime and then checks what's not on the list. It spends about half the time checking through the multiples of two, so I could make it go twice as fast by getting rid of that... Idk...
