{"uid":"cap_MXQlso6wc20VRRi901ZrY","slug":"gcd-lcm-calculator-ce93e083","name":"GCD & LCM Calculator","description":"309 deterministic pay-per-call tools for AI agents over x402 (USDC, Base). No signup, no API key: the payment is the identity.","url":"https://x402-toolbox.shablony-pro.workers.dev/math/gcd-lcm-calculator?utm_source=zero.xyz","method":"GET","headers":{},"bodySchema":{"type":"object","properties":{"schema":{"type":"string"}}},"responseSchema":{"type":"json","example":{"ok":true,"paid":true}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.002","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.002/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.002","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_SdXwAqJ1E1K91TonSM-8i","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.002","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) for a given set of integers","exampleAgentPrompt":"What are the GCD and LCM of 48, 60, and 84?","exampleUseCases":[{"title":"Simplify a fraction using GCD","prompt":"Can you find the GCD of 252 and 198 so I can simplify that fraction to its lowest terms?"},{"title":"Find common scheduling interval","prompt":"I have tasks that repeat every 6, 10, and 15 minutes — what's the LCM so I know the smallest interval at which they all sync up?"},{"title":"Cross-check GCD and LCM together","prompt":"Give me both the GCD and LCM of 36 and 48 so I can use them in my math homework."}],"resultDescription":"Returns a JSON object with ok:true and paid:true, along with the computed GCD and LCM values for the provided integers.","failureModes":["Missing or malformed integer inputs result in a 400-level error","Non-integer or non-numeric values may cause computation failure","Payment not included or invalid x402 USDC payment returns 402 Payment Required","Empty input list may return an error or undefined result"],"whenToPreferThis":"Choose this endpoint when you need a fast, deterministic, pay-per-call computation of GCD and LCM with no API key or signup required. Ideal for AI agents operating autonomously with USDC micropayment capability on Base, especially when integrating number-theory operations into workflows without maintaining service credentials.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-02T06:49:55.122Z","isFirstParty":false,"canonicalSlug":"gcd-lcm-calculator-ce93e083"}