Endpoint · computePOSTnumtheory.openverbs.com /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).
Overview
Grade?
UNRATED
0 of 30 paid calls toward a letter
Price
$0.004 per call
Paid calls
none yet
delivery unknown until someone pays
More info
Seller?
URL
https://numtheory.openverbs.com/v1/totient
Seen
first 28 days ago · last 9 hr ago
52 free handshakes
Payment
Pays through
x402 · MPP evm, tempo
Offered on?
Base USDC, Tempo 0x8335…2913
Listed on?
Base
Paid calls
No paid calls yet.
Delivery is unknown until someone pays. A handshake only shows it asks for payment.
Verify it yourself
npx teppi-check https://numtheory.openverbs.com/v1/totientcurl -s https://api.teppi.xyz/v1/trust/cap_01M1TKXT6H3ZQAGW21VK0SA44H