GCD & LCM Calculator

Greatest common divisor and least common multiple of integers.

Free tier eligible — 500 calls/month with a free key from /pricing; x402 pay-per-call above quota.

Parameters

Parameter	Type	Required	Description
`a`	integer	optional	First integer
`b`	integer	optional	Second integer
`numbers`	array	optional	Array of two or more integers (instead of a/b)

Call it over MCP (JSON-RPC 2.0)

curl -s https://wingmanprotocol.com/mcp \
  -H 'Content-Type: application/json' \
  -H 'Accept: application/json, text/event-stream' \
  -d '{"jsonrpc": "2.0", "id": 1, "method": "tools/call", "params": {"name": "gcd_lcm", "arguments": {"a": 10, "b": 10, "numbers": []}}}'

Or plain HTTP

curl -s https://wingmanprotocol.com/tools/gcd_lcm \
  -H 'Content-Type: application/json' \
  -d '{"a": 10, "b": 10, "numbers": []}'

Try it live

Edit the JSON and run it — this POSTs to https://wingmanprotocol.com/tools/gcd_lcm from your browser.

This tool is x402-metered — agents pay per call with USDC on Base. The 402 response below is the standard x402 payment-requirements envelope: sign the EIP-3009 authorization and retry with the X-Payment header, or get a free key at /pricing (500 calls/month, no card, no crypto).