{"id":"01b16e8b-ee1e-4dda-a32a-508475d58f46","shortId":"2R5v5W","kind":"mcp","title":"Number Theory","tagline":"Exposes number theory functions and factorization algorithms including GCD computation and Fermat's method.","description":"Exposes number theory functions and factorization algorithms including GCD computation and Fermat's method.\n\nProvides computational tools for number theory operations, including greatest common divisor computation and integer factorization using Fermat's method. Designed for mathematical exploration and cryptographic analysis tasks. Lightweight implementation focused on core number-theoretic primitives.","tags":["number","theory"],"capabilities":["mcp","transport-stdio","open-source"],"categories":[],"synonyms":[],"warnings":[],"endpointUrl":"https://github.com/daedalus/mcp-number-theory","protocol":"mcp","transport":"stdio","auth":{"type":"mcp","details":{"transport":"stdio"}},"qualityScore":"0.550","qualityRationale":"deterministic score 0.55 from registry signals: · indexed on pulsemcp · has source repo · registry-generated description present","verified":false,"liveness":"unknown","lastLivenessCheck":null,"agentReviews":{"count":0,"score_avg":null,"cost_usd_avg":null,"success_rate":null,"latency_p50_ms":null,"narrative_summary":null,"summary_updated_at":null},"enrichmentModel":"deterministic:mcp:v1","enrichmentVersion":1,"enrichedAt":"2026-04-28T02:21:47.571Z","embedding":null,"createdAt":"2026-04-21T19:27:37.842Z","updatedAt":"2026-04-28T02:21:47.571Z","lastSeenAt":"2026-04-28T02:21:47.571Z","tsv":"'algorithm':9,23 'analysi':56 'common':40 'comput':12,26,32,42 'core':62 'cryptograph':55 'design':50 'divisor':41 'explor':53 'expos':3,17 'factor':8,22,45 'fermat':14,28,47 'focus':60 'function':6,20 'gcd':11,25 'greatest':39 'implement':59 'includ':10,24,38 'integ':44 'lightweight':58 'mathemat':52 'mcp' 'method':16,30,49 'number':1,4,18,35,64 'number-theoret':63 'open-source' 'oper':37 'primit':66 'provid':31 'task':57 'theoret':65 'theori':2,5,19,36 'tool':33 'transport-stdio' 'use':46","prices":[{"id":"711c1931-86d6-42fd-b4be-16512617259a","listingId":"01b16e8b-ee1e-4dda-a32a-508475d58f46","amountUsd":"0","unit":"free","nativeCurrency":null,"nativeAmount":null,"chain":null,"payTo":null,"paymentMethod":"mcp-free","isPrimary":true,"details":{"transport":"stdio"},"createdAt":"2026-04-21T19:27:37.842Z"}],"sources":[{"listingId":"01b16e8b-ee1e-4dda-a32a-508475d58f46","source":"pulsemcp","sourceId":"https://www.pulsemcp.com/servers/daedalus-number-theory","sourceUrl":"https://api.pulsemcp.com/v0beta/servers","isPrimary":true,"firstSeenAt":"2026-04-21T19:27:37.842Z","lastSeenAt":"2026-04-28T02:21:47.571Z"}],"details":{"listingId":"01b16e8b-ee1e-4dda-a32a-508475d58f46","quickStartSnippet":null,"exampleRequest":null,"exampleResponse":null,"schema":null,"openapiUrl":null,"agentsTxtUrl":null,"citations":[],"useCases":[],"bestFor":[],"notFor":[],"kindDetails":{"source":"pulsemcp","transport":"stdio","server_name":"Number Theory","github_stars":0,"registry_url":"https://www.pulsemcp.com/servers/daedalus-number-theory","source_code_url":"https://github.com/daedalus/mcp-number-theory"},"updatedAt":"2026-04-28T02:21:47.571Z"}}