Skip to main content
Glama
IBM

MCP Math Server

by IBM

tonelli_shanks

Find modular square roots for quadratic congruences x² ≡ a (mod p) using the Tonelli-Shanks algorithm to solve modular arithmetic problems.

Instructions

Solve x² ≡ a (mod p) using Tonelli-Shanks algorithm. (Domain: arithmetic, Category: modular_arithmetic)

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
aYes
pYes

Tool Definition Quality

Score is being calculated. Check back soon.

Install Server

Other Tools

Latest Blog Posts

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/IBM/chuk-mcp-math-server'

If you have feedback or need assistance with the MCP directory API, please join our Discord server