Loading UtilityForge…
CALCULATION DESK
Apply trial division up to the square root of the input. If any divisor is found, the number is composite and the factor list is reported.
WHAT THIS DOES
Runs entirely in your browser.
/tools/prime-checkerprime-checkerv4.0.0LOCAL · LOCAL RUNIMPLEMENTED — This workbench is functional in the current release.Presets for this workbench
No preset yet. A preset stores the values in this form — never the result — and only for workbenches that run entirely in your browser.
Collections
Saved on this device only. Turn on sync to carry them to another device.
METHOD / LOCAL RUN
Trial division by integers 2..⌊√n⌋. If none divide n, n is prime.
Boundary: Practical for n up to 10^7. Larger numbers should use probabilistic primality tests.
The calculation or transformation runs in your browser using the values entered above. No input is sent to UtilityForge for this tool.
EXAMPLES / LOCAL RUN FIXTURES
FAQ
No. The prime checker runs locally.
The workbench states the exact method behind every result — the formula or procedure this page runs — so you can verify the computation instead of trusting a black box.
No. This workbench runs in the page: Number are read by the code your browser already downloaded, and UtilityForge receives neither the values nor the result.
Practical for n up to 10^7. Larger numbers should use probabilistic primality tests.
RELATED TOOLS
LOCAL — Runs entirely in your browser.
COMMON USE CASES / SOURCE NOTE
Last reviewed:
Source information: Local trial division.