Math MCP server for primality, factorization, Java templates, and integer multiplication.
Call this server's tools from your browser. Nothing to install.
Requests go through mcptry because browsers can't call most MCP servers directly. Header values are sent to the server for that request only and are never stored or logged.
Tool list from our last check. Connect live to refresh it.
Multiply two integers using the Common-Base Multiplication Method: x=N+a, y=N+b, xy=N^2+N(a+b)+ab. Returns the chosen base, offsets, terms, and exact result.
First integer
Second integer
Common base N. If omitted by a client, use a convenient nearby base such as a multiple of 10.
This tool isn't marked read-only, so it may change something on the server or in an account you connected.
Multiply two integers using the Common-Base Multiplication Method: x=N+a, y=N+b, xy=N^2+N(a+b)+ab. Returns the chosen base, offsets, terms, and exact result.
| Argument | Type | Description |
|---|---|---|
| x |
| integer |
| First integer |
| y* | integer | Second integer |
| base* | integer | Common base N. If omitted by a client, use a convenient nearby base such as a multiple of 10. |
{
"type": "object",
"required": [
"x",
"y",
"base"
],
"properties": {
"x": {
"type": "integer",
"description": "First integer"
},
"y": {
"type": "integer",
"description": "Second integer"
},
"base": {
"type": "integer",
"description": "Common base N. If omitted by a client, use a convenient nearby base such as a multiple of 10."
}
},
"additionalProperties": false
}Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code.
| Argument | Type | Description |
|---|---|---|
| algorithm* | string | Algorithm identifier: gcd, is_prime, or factorial |
{
"type": "object",
"required": [
"algorithm"
],
"properties": {
"algorithm": {
"type": "string",
"description": "Algorithm identifier: gcd, is_prime, or factorial"
}
},
"additionalProperties": false
}Check whether an integer is prime and return its prime factorization. Supports integers from -10^12 through 10^12; prime status is defined only for n >= 2.
| Argument | Type | Description |
|---|---|---|
| number* | integer | Integer to analyze, from -1000000000000 to 1000000000000 |
{
"type": "object",
"required": [
"number"
],
"properties": {
"number": {
"type": "integer",
"description": "Integer to analyze, from -1000000000000 to 1000000000000"
}
},
"additionalProperties": false
}