The full upstream README, mirrored here for reference. Install config, tool schemas, adoption signals, and an original overview live on the MCP Parigp listing page.
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()