numtheory.openverbs.com
6 resources listed under numtheory.openverbs.com.
Source: https://api.cdp.coinbase.com/platform/v2/x402/discovery/resources · last updated 2026-09-18
Resources
Least common multiple of two or more positive integers (arbitrary prec
Least common multiple of two or more positive integers (arbitrary precision).
Compute (base ^ exponent) mod modulus efficiently for arbitrary-precis
Compute (base ^ exponent) mod modulus efficiently for arbitrary-precision integers. The modulus must be positive.
Euler's totient φ(n) — the count of integers in [1, n] coprime to n —
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).
Miller-Rabin primality test (with witnesses that are exact for all 64-
Miller-Rabin primality test (with witnesses that are exact for all 64-bit integers) on an arbitrary-precision integer. Returns { prime }.
Prime-factorize a positive integer (≤ 10^15 so the computation is alwa
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.
Greatest common divisor of two or more non-negative integers (arbitrar
Greatest common divisor of two or more non-negative integers (arbitrary precision).
Machine-readable
All resources from this provider: /discovery/merchant (by payment address) or filter /discovery/resources.