{"uid":"cap_L_EdOQ3cTarA821Hyd_fL","slug":"numora-gcd-lcm-computation-a01e5f2d","name":"Numora GCD & LCM Computation","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://numorapoi.orbonomy.xyz/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":"probe","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.03/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_dNO-0V-Yg2yXxuNlByFE1","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.03","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","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":null,"resultDescription":"Returns a JSON object with success=true, a result object containing the GCD and LCM of the two input integers, and a human-readable computation string describing what was calculated.","failureModes":["Missing required parameter a or b returns an error","Non-integer inputs (floats, strings) likely cause validation failure","Payment failure (x402) if USDC micropayment not provided or insufficient","Both inputs being 0 may produce undefined or error result"],"whenToPreferThis":"Use this endpoint when you need both GCD and LCM computed together for two integers in a single call, without relying on external libraries or services. Ideal for number theory tasks, fraction simplification, cycle alignment, or scheduling problems where shared divisors matter.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:04:00.271Z","isFirstParty":false}