Skip to main content
Glama
IBM

MCP Math Server

by IBM

wilson_theorem_verify

Verify Wilson's theorem for prime numbers by calculating (p-1)! ≡ -1 (mod p) with detailed step-by-step computation.

Instructions

Verify Wilson's theorem for a given prime with detailed calculation. (Domain: arithmetic, Category: wilson_theorem)

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
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