Prime number tools
calc_primesCheck primality, factor large integers, compute divisors, Euler φ, GCD/LCM, and list primes in a range from expressions up to 400 digits.
Instructions
Number theory with big integers, like the website. check: is a number prime (trial division, deterministic Miller-Rabin below 2^64, probabilistic above), its prime factorisation (Pollard rho), number of divisors, sum of divisors σ, Euler φ, the divisor list, previous/next prime and whether it is perfect; the number may be an expression like "2^61-1", "10!+1" or "1000003*1000033" (up to 400 digits). gcd_lcm: GCD and LCM of 2–50 numbers with Euclid's steps. range: list the primes between two numbers (below 10^15, at most 10,000,000 numbers per range). Web version: https://s3eidat.github.io/prime-tools/
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | range: end (inclusive), below 10^15. | |
| from | No | range: start (inclusive). | |
| mode | No | What to do. | check |
| limit | No | range: return at most this many primes in the list (the count is always exact). | |
| number | No | check: the number or expression, e.g. "600851475143" or "2^89-1". | |
| numbers | No | gcd_lcm: the whole numbers (2–50, expressions allowed). |