{"uid":"cap_c01SsPgjcaDMNOFMGU4YI","slug":"numora-gcd-lcm-calculator-edb18770","name":"Numora GCD & LCM Calculator","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numomo.vercel.app/api/number/gcd-lcm","method":"POST","headers":{},"bodySchema":{"type":"object","required":["a","b"],"properties":{"a":{"type":"integer"},"b":{"type":"integer"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","displayCostAsset":"USDC","priceDynamic":false,"priceHint":null,"priceStatus":"priced","priceSource":"registry","requiresHandshake":false,"reviewCount":0,"rating":{"score":"0.00","successRate":"0.00","reviews":0,"stars":null,"state":"unrated"},"availabilityStatus":"unknown","priceObserved":null,"sessionDeposit":null,"pricing":{"kind":"static","summary":"$0.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_1ml0A4Rkj9O5kSEol-7CH","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of two integers","exampleAgentPrompt":"What are the GCD and LCM of 48 and 180?","exampleUseCases":[{"title":"Fraction simplification via GCD","prompt":"I need to simplify the fraction 84 over 126 — can you find the greatest common divisor of 84 and 126 so I can reduce it?"},{"title":"Scheduling recurring events with LCM","prompt":"Two tasks repeat every 12 days and every 18 days respectively — what's the least common multiple of 12 and 18 so I know when they'll sync up again?"},{"title":"Number theory homework check","prompt":"Can you compute the GCD and LCM of 360 and 450 for me? I want to verify my number theory answers."}],"resultDescription":"Returns a JSON object with `success: true`, a `result` object containing the GCD and LCM of the two provided integers, and a `computation` string describing what was calculated in human-readable form.","failureModes":["Non-integer inputs (e.g. floats or strings) fail schema validation","Missing required field `a` or `b` returns an error","Both inputs being zero is mathematically undefined and may return an error","Payment failure via x402 micropayment returns a 402 status before computation runs"],"whenToPreferThis":"Choose this endpoint when you need both GCD and LCM for a pair of integers in a single call with no external dependencies. Ideal for agents handling number theory problems, fraction simplification, scheduling alignment, or algebraic computation without spinning up a local math library. Prefer over general-purpose code execution when a deterministic, low-latency, micropayment-gated math endpoint is acceptable.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-16T00:50:16.078Z","isFirstParty":false}