lizhuanggarden.comsince 2017-10-07

GQQ Primality Test

A fast and deterministic primality test.

Time complexity:O(ln n)^{2}.

1.Introduction
About GQQ Primality Test2.Primality Test Click this button to test the primality of a number.

3.Search continuous primes You can also ask to find some primes starting from a number.

4.Inquery Primality 2^n Each list shows 10,000 or less prime numbers starting at 2^n.

5.Inquery Primality 10^n Each list shows 10,000 or less prime numbers starting from 10^n.

6.Strong Primes The primes length are from 128 to 640 bits.

7.find SP The length of the strong primes are from 40 to 2048 bits.

8. Funny primesAre 11,11111111111 and 1111111111111111111 primes?

9. Question and answer

10. 大數