The project enumerate every prime number using trial division at a fast speed. (Run in turbo mode if you want to speed the calculation time up.) -You can resume your calculation by clicking on "Continue with number" and insert the number you get from the last time. -You can test if a single number is prime number by clicking "Test a single number" and insert the number you want to test. -The number you enter into the "continue with number" and "test a single number" under Mersenne prime mode is the value of P (as in 2^P-1), not the number itself.
Versions: (version marked "*" did not get published) *1.0 the basic "enumerate prime" function created *2.0 "test a single number" function created algorithm optimization (made faster) 3.0 "continue with number" function created UI optimization (made prettier) 4.0 algorithm optimization (made faster) fixed a bug that occurs when continue with number. 5.0 Mersenne Prime functions added 6.0 Number/Time Graph added 7.0 Fixed speed graph for Scratch 3.0
