MCP server exposing cypari2 (PARI/GP) number theory library
Copy the AI prompt to install this server into Claude Code, Cursor, or another agent β or use 1-click editor setup below.
We haven't yet run this listing's install command through our automated sandbox check. This isn't a red flag β we're steadily working through the catalog.
π‘ Paste the JSON block into your client's configuration file under mcpServers, then restart the application.
MCP server exposing cypari2 (PARI/GP) number theory library
mcp-name: io.github.daedalus/mcp-parigp
Run directly:
Or use with an MCP client by configuring in your settings:
factor(n) - Factor an integerisprime(n) - Test if n is primegcd(a, b) - Greatest common divisorphi(n) - Euler's totient functionsigma(n, k) - Sum of k-th power of divisorsjacobi(a, n) - Jacobi symbolznorder(x, n) - Multiplicative order modulo nprimes(n) - First n primesnextprime(n) - Next prime after npolroots(pol) - Find roots of polynomialpolcyclo(n) - n-th cyclotomic polynomialderiv(pol) - Derivative of polynomialsubst(pol, v, expr) - Substitute in polynomialnfinit(pol) - Initialize number fieldbnfinit(pol) - Initialize with Buchmann's algorithmidealadd(nf, a, b) - Add idealsidealmul(nf, a, b) - Multiply idealsellinit(eq) - Initialize elliptic curveellap(E, p) - Trace of Frobenius at pelltors(E) - Torsion subgroupellheight(E, P) - Canonical heightmatid(n) - nΓn identity matrixmatdet(m) - Matrix determinantmatinv(m) - Matrix inversematrank(m) - Matrix ranksin, cos, tan, asin, acos, atansinh, cosh, tanh, asinh, acosh, atanhexp, log, sqrt, abspi(), euler(), I()No reviews yet β be the first to share how this listing worked for you.
Showcase your server listing on GitHub or your project documentation. Embed this dynamic SVG badge to highlight official listing status and live engagement.
[](https://allmcps.com/mcp/mcp-parigp)<a href="https://allmcps.com/mcp/mcp-parigp"><img src="https://allmcps.com/api/badge/mcp-parigp?style=directory" alt="MCP Parigp on AllMCPs" /></a>