{"uid":"cap_sEQhqYcns5AAvaN_6kXtp","slug":"numora-diophantine-equation-solver-0fe1738f","name":"Numora Diophantine Equation Solver","description":"100 pure math computation endpoints for AI agents. Statistics, financial math, linear algebra, equation solving, calculus, number theory, sequence generation, and unit conversions. Zero external dependencies. x402 micropayments on Base.","url":"https://numorapoi.orbonomy.xyz/api/number/diophantine?utm_source=zero.xyz","method":"POST","headers":{},"bodySchema":{"type":"object","required":["a","b","c"],"properties":{"a":{"type":"integer"},"b":{"type":"integer"},"c":{"type":"integer"}}},"responseSchema":{"type":"object","required":["success","result","computation"],"properties":{"result":{"type":"object","description":"Computation result varies by endpoint"},"success":{"type":"boolean","description":"Always true on success"},"computation":{"type":"string","description":"Human-readable description of what was computed"}}},"example":null,"exampleRequest":null,"tags":["x402"],"displayCostAmount":"0.1","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.03/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.03","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_jyj6QA3JGjNOJNqmAeWaH","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.03","costPer":"request","priority":0,"asset":"0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913","unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Solves linear Diophantine equations of the form ax + by = c, returning integer solutions if they exist","exampleAgentPrompt":"Can you solve the linear Diophantine equation 7x + 3y = 1 and find me integer values of x and y that satisfy it?","exampleUseCases":null,"resultDescription":"Returns a JSON object with a boolean success flag, a result object containing integer solutions (x, y) if they exist or a message indicating no solution exists, and a human-readable computation string describing what was solved.","failureModes":["No integer solution exists when gcd(a,b) does not divide c — endpoint should return success:false or a result indicating no solution","Missing required fields a, b, or c return a validation error","Non-integer inputs for a, b, c cause schema validation failure","Payment failure via x402 if USDC balance is insufficient","Server error if coefficients are extremely large causing overflow"],"whenToPreferThis":"Use this endpoint when you need to determine whether integers x and y exist satisfying ax + by = c, or when you need a particular integer solution to such an equation. Prefer this over general algebra solvers when you specifically need integer (not real-valued) solutions and want a pure-math, dependency-free computation with micropayment pricing per call.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-10-15T00:42:48.876Z","isFirstParty":false,"canonicalSlug":"numora-diophantine-equation-solver-0fe1738f"}