{"uid":"cap_hDT6CCQIXPS8aFJ9wj6HM","slug":"signaldesk-ai-gcd-greatest-common-divisor-calculator-6b7698c8","name":"SignalDesk AI – GCD (Greatest Common Divisor) Calculator","description":"Evidence-backed autonomous AI jobs and paid data tools. Queue/D1/cron run outside the chat; free quotas and bounded execution apply.","url":"https://x402-agent.kariguetoazul.workers.dev/api/math/gcd?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","properties":{"a":{"type":"integer","maximum":1000000000,"minimum":-1000000000,"description":"First integer."},"b":{"type":"integer","maximum":1000000000,"minimum":-1000000000,"description":"Second integer."}}},"responseSchema":{"type":"json","example":{"gcd":6}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.001","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.001/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.001","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_uR6YaDRUI2mdjTU9spMSQ","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.001","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) of two integers via a paid API call.","exampleAgentPrompt":"What is the greatest common divisor of 48 and 18?","exampleUseCases":[{"title":"Fraction simplification helper","prompt":"I need to simplify the fraction 252/105 — can you find the GCD of 252 and 105 so I can reduce it to its lowest terms?"},{"title":"Ratio reduction for recipe scaling","prompt":"I'm scaling a recipe and need to reduce the ratio 750 to 250 — what's the greatest common divisor of 750 and 250?"},{"title":"Cryptography modulus check","prompt":"For a number theory exercise, can you compute the GCD of 999983 and 999979 to check if they share any common factors?"}],"resultDescription":"Returns a JSON object with a single field 'gcd' containing the integer greatest common divisor of the two provided integers. Example: {\"gcd\": 6}.","failureModes":["Input integers outside the range -1,000,000,000 to 1,000,000,000 will be rejected with a validation error","Non-integer or missing values for 'a' or 'b' will cause a 400-level error","Payment failure via x402 protocol will result in a 402 Payment Required response","Both inputs being zero is mathematically undefined and may return an error or zero"],"whenToPreferThis":"Choose this endpoint when you need a quick, programmatic GCD computation for two integers within the ±1 billion range and are already operating within an x402 micropayment-enabled workflow. It is purpose-built for number theory tasks and is far simpler than embedding a general-purpose math engine.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-13T00:42:14.810Z","isFirstParty":false,"canonicalSlug":"signaldesk-ai-gcd-greatest-common-divisor-calculator-6b7698c8"}