Math & Numbers
σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².
Call this tool from your code in three languages.
curl -X POST 'http://127.0.0.1:3003/en/api/tools/perfect-number-checker' \
-H 'Content-Type: application/json' \
-d '{"n":"28","detail":"divisors"}'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/perfect-number-checker| Name | Type | Required | Description |
|---|---|---|---|
| n | text | Yes | 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-perfect-number-checker": {
"name": "perfect-number-checker",
"description": "σ(n) = 2n ⟺ perfect. Factorization-based σ(n), proper-divisor sum, deficient/perfect/abundant classification, abundancy index, Euclid–Euler form. n ≤ 10¹².",
"baseUrl": "http://127.0.0.1:3003/mcp/sse?toolId=perfect-number-checker",
"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": "perfect-number-checker",
"arguments": {
"n": "28",
"detail": "divisors"
}
}
}Questions or issues? Contact [email protected]