uhh... oops my friend kinda released his own prime finder right when I finished my own.. Well go check out his here: https://scratch.mit.edu/projects/1261847095 How this works is it simply cycles through all previous primes in the list and checks if the current number is divisible via seeing if the modulo value is 0
