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.
Prime number test improved using Sieve of Eratosthenes I really like the bar graph you put in, Feng!
