{"uid":"cap_S-BJC3FS31lrLjJRLtcea","slug":"gcd-and-lcm-calculator-4298deee","name":"GCD and LCM Calculator","description":"Kostenlose Guides, Solo-Playbooks und Artikel zu KI, Automation und Side Hustles — für Menschen, die mit echten Systemen online Einkommen aufbauen wollen. Transparent finanziert über faire Affiliate-Links.","url":"https://kihustle.tech/nexus/api/v1/gcd-lcm-calculator?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"integer"},"b":{"type":"integer"}}},"responseSchema":{"type":"json","example":{"result":"processed","status":"success"}},"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_xaELSRpD6Cfdy4yHzzBMM","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) of two integers","exampleAgentPrompt":"What are the GCD and LCM of 48 and 180?","exampleUseCases":[{"title":"Simplify a fraction automatically","prompt":"I need to simplify the fraction 144 over 60 — can you find the GCD of 144 and 60 so I can reduce it to lowest terms?"},{"title":"Find LCM for scheduling overlap","prompt":"Two tasks repeat every 8 and 14 days respectively — what's the LCM of 8 and 14 so I know when they'll sync up again?"},{"title":"Check if two numbers share common factors","prompt":"What's the greatest common divisor of 315 and 105? I want to know how many equal groups I can split both quantities into."}],"resultDescription":"A JSON object indicating the computed result (GCD and/or LCM of the two input integers) along with a status field confirming success. The result field contains the numeric answer.","failureModes":["Non-integer inputs may cause validation errors or unexpected behavior","Missing required fields 'a' or 'b' likely returns an error or null result","Very large integers may exceed processing limits","Division by zero or zero inputs may produce undefined mathematical results","Generic response schema means specific error codes are not well-documented"],"whenToPreferThis":"Use this endpoint when you need a lightweight, pay-per-call API to compute GCD or LCM of two integers without setting up a local math library. Suitable for agents needing on-demand arithmetic computation in workflows where importing math utilities is impractical.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-12T12:49:21.128Z","isFirstParty":false,"canonicalSlug":"gcd-and-lcm-calculator-4298deee"}