Prime Checker Взлом 4.0

Скриншоты

Описание

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

История обновлений

4.0

2023-10-23

* Fixed a bug that sometimes returned negative solutions when expressing prime numbers in the form x^2-2y^2.
* Replaced an internally used third-party numerical calculation library to original library.
* Added SQUFOF to the prime factorization algorithm.

3.1

2020-02-17

The bug had been fixed when displaying in dark mode.
You can remember the last number you checked.

2.2

2015-12-21

Fix the bug to crash when the user selects a small integer.

2.1

2014-11-12

You can use ECM for factorization.
It became much easier to find the next and previous prime number.

2.0

2014-10-29

iOS8 is supported.
User interface is tuned.
Factorization is more faster.
More big numbers are available.