Math & Numbers
Exact φ(n) from trial-division factorization (n ≤ 10¹²) with optional coprime listing and Euler's theorem recall.
Call this tool from your code in three languages.
curl -X POST 'http://127.0.0.1:3003/en/api/tools/euler-totient-function' \
-H 'Content-Type: application/json' \
-d '{"n":"36","detail":"list"}'Send a POST request with your inputs as JSON. File parameters require a separate upload first.
POST http://127.0.0.1:3003/en/api/tools/euler-totient-function| Name | Type | Required | Description |
|---|---|---|---|
| n | text | Yes | Positive integer, 1 ≤ n ≤ 10¹² (trial-division factorization bound). |
| detail | select | Yes | — |
Text result
{
"result": "Processed text content",
"error": "Error message (optional)",
"message": "Notification message (optional)",
"metadata": {
"key": "value"
}
}Add this tool to your Model Context Protocol server so AI agents can list and call it.
Add this block to your MCP client configuration:
{
"mcpServers": {
"elysiatools-euler-totient-function": {
"name": "euler-totient-function",
"description": "Exact φ(n) from trial-division factorization (n ≤ 10¹²) with optional coprime listing and Euler's theorem recall.",
"baseUrl": "http://127.0.0.1:3003/mcp/sse?toolId=euler-totient-function",
"command": "",
"args": [],
"env": {},
"isActive": true,
"type": "sse"
}
}
}After connecting to the SSE endpoint, list the exposed tools:
{
"jsonrpc": "2.0",
"id": 1,
"method": "tools/list"
}Invoke the tool by its id, passing arguments built from its parameters:
{
"jsonrpc": "2.0",
"id": 2,
"method": "tools/call",
"params": {
"name": "euler-totient-function",
"arguments": {
"n": "36",
"detail": "list"
}
}
}Questions or issues? Contact [email protected]