Online Prime Number Checker

Online Prime Checker

Help GitHub

Help

×

Available Operators

+: addition / unary plus
-: subtraction / unary minus
*: multiplication
/: division (truncated)
%: modulo
**: exponentiation
!: factorial

Testing Method

Baillie-PSW primality test is used. More specifically, it performs the following tests:

Perform trial division up to p < 1000 and confirm the input number is not a square.
Perform a Miller-Rabin test (strong probable prime test) with base 2.
Perform an extra strong Lucas-Selfridge test.

So far, there are no known composite numbers that pass the test.
In particular, it returns a correct answer for all numbers less than 2**64 (source).

Implementation

Computation is performed completely inside a browser. It does not require any communication with servers.
The core part is written in Rust and compiled into WebAssembly. See GitHub repository for detail.

Supported Browsers

Latest versions of Chrome, Firefox, Safari, Edge

Result: -