No merchant-supplied description has been published for numtheory.openverbs.com. Browse its currently listed x402 offerings and observed catalog information.
This provider profile is generated from public catalog observations and has no verified controller.
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.
https://numtheory.openverbs.com/v1/factorizeGreatest common divisor of two or more non-negative integers (arbitrary precision).
https://numtheory.openverbs.com/v1/gcdEuler'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).
https://numtheory.openverbs.com/v1/totientCompute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.
https://numtheory.openverbs.com/v1/modpowLeast common multiple of two or more positive integers (arbitrary precision).
https://numtheory.openverbs.com/v1/lcmMiller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.
https://numtheory.openverbs.com/v1/is-prime