checks thousands of numbers every second (this will go down over time) and filters out all prime numbers and puts them into the list with cloud variable: https://scratch.mit.edu/projects/527292107/ FYI - the divident is the number being divided and the divisor is what the divident is being divided by HOW THIS WORKS First of all, only odd numbers are checked (because all even numbers can be divided by 2), essentially making this twice as fast. The reason why 2 is in this list is because it's added at the start. The script checks if the number it's checking (the divident) can be divided by any odd numbers (there is no point checking if it can be divided by even numbers since that would be useless as it will never check even numbers) under the divident's square root. If it cannot be divided by any of these numbers, it is prime.
100% of the script is made by me
