{"uid":"cap_uGgMeRIMzE6W6blrjeUEd","slug":"number-theory-lcm-502c3e47","name":"Number Theory LCM","description":"Least common multiple of two or more positive integers (arbitrary precision).","url":"https://numtheory.openverbs.com/v1/lcm","method":"POST","headers":{},"bodySchema":{"type":"object","$schema":"https://json-schema.org/draft/2020-12/schema","required":["input"],"properties":{"input":{"type":"object","required":["type","method","bodyType","body"],"properties":{"body":{"type":"object","required":["values"],"properties":{"values":{"type":"array","items":{"type":"string","pattern":"^\\d+$"},"maxItems":256,"minItems":2,"description":"Two or more non-negative integers as decimal strings."}},"additionalProperties":false},"type":{"type":"string","const":"http"},"method":{"enum":["POST"],"type":"string"},"bodyType":{"enum":["json","form-data","text"],"type":"string"}},"additionalProperties":false}}},"responseSchema":null,"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.004","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.004/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.004","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_QDMkpV3MKh4qay7BZN0zE","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.004","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Computes the Least Common Multiple (LCM) of two or more non-negative integers supplied as decimal strings","exampleAgentPrompt":"What is the least common multiple of 12, 18, and 24?","exampleUseCases":[{"title":"Synchronized task scheduling","prompt":"I have three jobs that repeat every 8, 12, and 15 minutes — what's the smallest interval at which they'll all sync up at the same time? Compute the LCM of 8, 12, and 15."},{"title":"Fraction arithmetic denominator","prompt":"I need to add the fractions 1/14, 1/21, and 1/35 — can you find the least common multiple of 14, 21, and 35 so I can use it as a common denominator?"},{"title":"Music beat alignment","prompt":"I have three drum loops with lengths 16, 24, and 36 beats — what's the LCM of 16, 24, and 36 so I know when all three loops will align back to the start?"}],"resultDescription":"Returns the least common multiple of all provided integers as a numeric value, representing the smallest positive integer evenly divisible by every number in the input list.","failureModes":["Input array has fewer than 2 elements — rejected with validation error","Values contain non-numeric or negative strings — rejected due to pattern constraint","More than 256 values supplied — rejected due to maxItems constraint","Network or payment authorization failure — HTTP 402 or 5xx response"],"whenToPreferThis":"Choose this endpoint when you need a reliable, pay-per-call computation of the LCM of two to 256 integers without running your own math service. It is ideal for agents handling dynamic scheduling, fraction arithmetic, or periodic synchronization problems where the operand count or size varies at runtime.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-15T00:31:38.437Z","isFirstParty":false}