Gcd Calculate

Calculators REST API MCP

Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of two non-negative integers. Uses the Euclidean algorithm.

This page documents the MCP tool findutils:gcd_calculate. See the REST reference →

View as Markdown

Call it over MCP

Tool name findutils:gcd_calculate · no API keys · 120 requests/min per IP

Claude Code

claude mcp add findutils --transport http https://mcp.findutils.com/

Claude Desktop — claude_desktop_config.json

{
  "mcpServers": {
    "findutils": {
      "url": "https://mcp.findutils.com/"
    }
  }
}

Raw JSON-RPC (any MCP client) — verified example

curl -X POST https://mcp.findutils.com/ \
  -H "Content-Type: application/json" \
  -d '{
    "jsonrpc": "2.0",
    "id": 1,
    "method": "tools/call",
    "params": {
      "name": "gcd_calculate",
      "arguments": {
        "a": 12,
        "b": 18
      }
    }
  }'

Input schema

Argument Type Required Description
a integer yes First integer.
b integer yes Second integer.

Example arguments (verified)

{
  "a": 12,
  "b": 18
}

Also a REST endpoint

The same tool answers plain HTTP at POST /api/tools/gcd-calculate/execute — no key, 60 requests/min.

Open the REST reference for Gcd Calculate →

More Calculators tools