Appearance
Prime Number Calculators
This page contains calculators that verify prime numbers in various ways. Enter a natural number, n
to determine if it's prime or likely prime. Enter k
for the number of unique samples of a
as it applies to Fermat's Little Theorem. Press the Calculate
button to get the answer. Press the Clear
button to remove the results.
WARNING
This program attempts to handle reasonably large values; however, an excessive n
value could cause this program to stall or even crash. Close the browser tab to recover.
Status | Function Name | Is Prime | Time (ms) | Composite |
---|---|---|---|---|
Trial By Division | ||||
Trial By Division (√n) | ||||
Fermat's Little Theorem |