Euler's totient
Least common multiple of two or more positive integers (arbitrary precision).
numtheory.openverbs.comBase last paid 26d ago
- Category
- Developer tools
- Starting price
- $0.004
- Paid calls · 30 days
- 5
- Unique payers · 30 days
- 5
Paid endpoints
5 endpoints, sorted by usage. Prices are per request.
- POST/v1/lcm
Least common multiple of two or more positive integers (arbitrary precision).
$0.004Base1calls / 30d - POST/v1/modpow
Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.
$0.004Base1calls / 30d - POST/v1/totient
Euler's totient φ(n) — the count of integers in [1, n] coprime to n — for a positive integer ≤ 10^15 (it is computed from the prime factorization).
$0.004Base1calls / 30d - POST/v1/gcd
Greatest common divisor of two or more non-negative integers (arbitrary precision).
$0.004Base1calls / 30d - POST/v1/factorize
Prime-factorize a positive integer (≤ 10^15 so the computation is always fast). Returns the prime factors with exponents, the divisor count, and whether n is prime.
$0.004Base1calls / 30d