Skip to main content
Glama

MCP Math Server

gcm

Calculate the greatest common divisor (GCD) of two numbers to find the largest integer that divides both without a remainder.

Instructions

Calculate the greatest common measure (GCD) of two numbers

Input Schema

NameRequiredDescriptionDefault
aYes
bYes

Input Schema (JSON Schema)

{ "$schema": "http://json-schema.org/draft-07/schema#", "additionalProperties": false, "properties": { "a": { "type": "number" }, "b": { "type": "number" } }, "required": [ "a", "b" ], "type": "object" }

Other Tools from MCP Math Server

Related Tools

    MCP directory API

    We provide all the information about MCP servers via our MCP API.

    curl -X GET 'https://glama.ai/api/mcp/v1/servers/codewithmsunke/MCPMathTools'

    If you have feedback or need assistance with the MCP directory API, please join our Discord server