{"uid":"cap_iYSaOjQ34uNxEVPYO3e8G","slug":"gcd-and-lcm-calculator-b505dab1","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/agents/api/v1/gcd-lcm-calculator","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_mUI5mx1frWth8837iH4VB","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":"Can you calculate the GCD and LCM of 48 and 180 for me?","exampleUseCases":[{"title":"Simplifying a fraction with GCD","prompt":"I have the fraction 144 over 252 — can you find the GCD of 144 and 252 so I can simplify it to lowest terms?"},{"title":"Finding a common denominator","prompt":"I need to add the fractions 1/36 and 1/48 — what's the LCM of 36 and 48 so I can find the least common denominator?"},{"title":"Scheduling recurring events","prompt":"One event repeats every 12 days and another every 20 days — what's the LCM of 12 and 20 so I know when they'll next coincide?"}],"resultDescription":"A JSON object indicating the computed result (GCD and/or LCM of the two input integers) along with a success status field.","failureModes":["Non-integer inputs may cause validation errors or unexpected results","Missing required fields 'a' or 'b' will likely return an error","Division by zero scenarios (e.g. one input is 0) may return undefined behavior or error","Very large integers may cause overflow or timeout"],"whenToPreferThis":"Use this endpoint when you need a quick, paid-API computation of GCD and/or LCM for two integers without running local code — suitable for agents that lack a code-execution environment or need a consistent external compute call for number-theory tasks.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T07:11:43.149Z","isFirstParty":false}