Endpoints: 76,849MCP servers: 32,730Payout addresses: 3,825Paid calls: 6,168Letters: 84Defects: 3,898counted just now
teppi

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).
UNRATEDDelisted

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

URL
https://numtheory.openverbs.com/v1/totient
Seen
first 2 months ago · last 29 days ago
81 free handshakes

Payment

Pays through
x402 · MPP evm, tempo
Offered on?
Base USDC, Tempo 0x8335…2913
Listed on?
Base

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
[![Teppi](https://api.teppi.xyz/badge/cap_01M1TKXT6H3ZQAGW21VK0SA44H.svg)](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 yourselfnpx teppi-check https://numtheory.openverbs.com/v1/totientcurl -s https://api.teppi.xyz/v1/trust/cap_01M1TKXT6H3ZQAGW21VK0SA44H