{"uid":"cap_LqaXXwSqBCpEQ8DLfHCNX","slug":"numora-mersenne-number-endpoint-3eb70aa4","name":"Numora Mersenne Number Endpoint","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://numormo.vercel.app/api/number/mersenne","method":"POST","headers":{},"bodySchema":{"type":"object","required":["exponent"],"properties":{"exponent":{"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":"registry","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.1/call","primary":{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"},"accepted":[{"kind":"static","protocol":"x402","network":"base","amountUsd":"0.1","per":"call","confidence":"exact"}]},"paymentMethods":[{"uid":"pm_2XPo58yT6ZL-8cGn-l8eM","protocol":"x402","methodType":"crypto","chain":"base","mode":"charge","costAmount":"0.1","costPer":"request","priority":0,"asset":null,"unit":"request","depositMicros":null,"planRef":null}],"brandName":null,"brandSlug":null,"brandBaseUrl":null,"brandDocsUrl":null,"whatItDoes":"Checks whether 2^exponent − 1 is a Mersenne prime and returns the result with supporting computation details","exampleAgentPrompt":"Can you check whether 2^61 − 1 is a Mersenne prime using exponent 61?","exampleUseCases":[{"title":"Verify known Mersenne prime exponent","prompt":"Is 2^127 minus 1 actually a Mersenne prime? Use exponent 127 to check."},{"title":"Explore small Mersenne candidates","prompt":"Check whether exponent 11 gives a Mersenne prime — compute 2^11 minus 1 and tell me if it's prime."},{"title":"Educational number theory demo","prompt":"I'm teaching a class on Mersenne primes — can you show me the result for exponent 31, including whether it's prime and the actual number?"}],"resultDescription":"Returns a JSON object with a boolean success flag, a result object containing the Mersenne number (2^exponent − 1) and whether it is prime, and a human-readable computation string describing what was calculated.","failureModes":["Missing or non-integer exponent field returns a validation error","Very large exponents may exceed computation limits or time out","Negative or zero exponents may be rejected as invalid input","Payment failure via x402 micropayment protocol results in 402 response before computation occurs"],"whenToPreferThis":"Use this endpoint when you need a pure, serverless, zero-dependency computation of Mersenne primality for a specific integer exponent, especially in agent workflows that require on-demand number theory checks without setting up local math libraries. Prefer it over general-purpose CAS tools when you want a lightweight, pay-per-call API with predictable output schema.","instructions":null,"reviewSummary":null,"reviewSummaryHighlights":null,"reviewSummaryConcerns":null,"reviewSummaryGeneratedAt":null,"activationCount":0,"lastUsedAt":null,"lastSuccessfullyRanAt":null,"lastHealthCheckAt":"2026-09-14T19:02:27.831Z","isFirstParty":false}