GQQ Primality Test
A fast and deterministic primality test.
Time complexity:O(ln n)2.
Input the starting number for asking to find with the opreators + - * / ^ ( ).
The starting number must be bigger than 9 and under 1000 digits.
The form of prime numbers are outputed with "starting number + difference number".
The amount of prime numbers that are showed is int(36658161733/(log(starting number,2))^3) peices.
If the amount is more than 10000 pieces, the program only shows 10000 peices, and is 0, the program does not work.