Help find prime numbers on Scratch! Just click start and it starts from where the last person left off. See how large we can go on scratch by working together! Tracks PRIMES PER MINUTE - see how fast your version is calculating primes. Tracks LARGEST PRIME/LARGEST NUMBER - helps speed up the search process. Tracks PRIMES FOUND - total amount of prime numbers found by the community (+/- 99) (May contain duplicates)
Just a proof of concept. Repeat (A) Times {If <(A)mod(B)=(0)> then { change (success) by (1) } } If (success) < (3) then { add (A) to (PRIME#) } This means that the program divides the current number by another number and checks if it has anything left over. If it does, then the division was unsuccessful at making an integer. If it doesn't have any remainder then it was a success. A prime number will only have two successful divisions: 1 and itself. So, if this is the case, the number is added to the list (and the counters are changed). If anyone has any suggestions or notices a bug or anything that is giving inaccurate results, let me know so I can fix it. Otherwise, its an easy concept with Scratch because of the "mod" operator.
