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 18 hr ago
52 free handshakes
Payment
Pays through
x402 · MPP evm, tempo
Offered on?
Base USDC, Tempo 0x8335…2913
Listed on?
Base
Buy it through Teppi
- ?Pay on delivery
- 0.006000 USDC (0.004000 to the seller, 0.002000 fee)
- Where
- https://api.teppi.xyz/v1/via/cap_01M1TKXT6H3ZQAGW21VK0SA44H
- ?Ask the price
curl -si -X POST https://api.teppi.xyz/v1/via/cap_01M1TKXT6H3ZQAGW21VK0SA44H -H 'content-type: application/json' -d '{}'
About
- ?Description
- 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).
- URL
- https://numtheory.openverbs.com/v1/totient
- Method
- POST
- Class
- compute
- ?Checkable to
- L1
- Endpoint id
- cap_01M1TKXT6H3ZQAGW21VK0SA44H
- ?Badge
Reads live. UNRATED until paid calls earn a letter.
- Markdown
- [](https://teppi.xyz/endpoint/cap_01M1TKXT6H3ZQAGW21VK0SA44H)
- HTML
- <a href="https://teppi.xyz/endpoint/cap_01M1TKXT6H3ZQAGW21VK0SA44H"><img src="https://api.teppi.xyz/badge/cap_01M1TKXT6H3ZQAGW21VK0SA44H.svg" alt="Teppi delivery record"></a>
- Image
- https://api.teppi.xyz/badge/cap_01M1TKXT6H3ZQAGW21VK0SA44H.svg
Verify it yourself
npx teppi-check https://numtheory.openverbs.com/v1/totientcurl -s https://api.teppi.xyz/v1/trust/cap_01M1TKXT6H3ZQAGW21VK0SA44H