Prime Checker

This application calculate values of given number which are described below:
* Integer factorization
* Euler's totient function
* Primitive root (if exist)
* x, y where x^2 + y^2 = p if p is 4n+1
* x, y where x^2 + 3y^2 = p if p is 3n+1
* x, y where x^2 + 2y^2 = p if p is 8n+1 or 8n+3
* x, y where x^2 - 2y^2 = p if p is 8n+1 or 8n+7
This application uses Fermat algorithm, Pollard's rho algorithm and Lenstra's ECM for factorization, Miller–Rabin algorithm for primality test