mcp-parigp

> MCP server exposing cypari2 (PARI/GP) number theory library

[](https://pypi.org/project/mcp-parigp/) [](https://pypi.org/project/mcp-parigp/) [](https://codecov.io/gh/daedalus/mcp-parigp) [](https://github.com/astral-sh/ruff)

mcp-name: io.github.daedalus/mcp-parigp

pip install mcp-parigp

Run directly:

mcp-parigp

Or use with an MCP client by configuring in your settings:

{
  "mcpServers": {
    "mcp-parigp": {
      "command": "mcp-parigp"
    }
  }
}

from mcp_parigp import eval_expression, factor, isprime

# Evaluate PARI/GP expressions
result = eval_expression("factor(100)")
print(result)  # [[2, 2], [5, 2]]

# Factor integers
print(factor(100))  # [[2, 2], [5, 2]]

# Test primality
print(isprime(29))  # True

• factor(n) - Factor an integer
• isprime(n) - Test if n is prime
• gcd(a, b) - Greatest common divisor
• phi(n) - Euler's totient function
• sigma(n, k) - Sum of k-th power of divisors
• jacobi(a, n) - Jacobi symbol
• znorder(x, n) - Multiplicative order modulo n
• primes(n) - First n primes
• nextprime(n) - Next prime after n

• polroots(pol) - Find roots of polynomial
• polcyclo(n) - n-th cyclotomic polynomial
• deriv(pol) - Derivative of polynomial
• subst(pol, v, expr) - Substitute in polynomial

• nfinit(pol) - Initialize number field
• bnfinit(pol) - Initialize with Buchmann's algorithm
• idealadd(nf, a, b) - Add ideals
• idealmul(nf, a, b) - Multiply ideals

• ellinit(eq) - Initialize elliptic curve