math-to-code-mcp
Math MCP server for primality, factorization, Java templates, and integer multiplication.
我該用這個嗎
品質與安全性
A
根據工具定義與協定合規性的自動化分析。
上下文成本
~307Token(工具定義)
~698 B典型回應大小
極小的注意力影響(128k 上下文的 0.24%)
這是每次將伺服器的工具載入模型上下文時所消耗的約略 token 數量。數量越高,可用於其他工作的注意力就越少。
安裝
一鍵安裝
將以下內容加入你的 `claude_desktop_config.json` 檔案:
{
"mcpServers": {
"math-to-code-mcp": {
"url": "https://math-to-code-mcp-production.up.railway.app/mcp"
}
}
}遠端端點
https://math-to-code-mcp-production.up.railway.app/mcpstreamable-http它能做什麼
工具清單
工具(3)
🟢 唯讀🟡 寫入🔴 刪除⚪ 未知
⚪generate_java_algorithm(algorithm)
Generate a Java implementation of a supported mathematical algorithm. This returns fixed, reviewed templates and does not execute generated code.
輸入結構描述
{
"type": "object",
"properties": {
"algorithm": {
"type": "string",
"description": "Algorithm identifier: gcd, is_prime, or factorial"
}
},
"required": [
"algorithm"
],
"additionalProperties": false
}🟢prime_analyze(number)
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.
輸入結構描述
{
"type": "object",
"properties": {
"number": {
"type": "integer",
"description": "Integer to analyze, from -1000000000000 to 1000000000000"
}
},
"required": [
"number"
],
"additionalProperties": false
}⚪common_base_multiply(x, y, base)
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.
輸入結構描述
{
"type": "object",
"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."
}
},
"required": [
"x",
"y",
"base"
],
"additionalProperties": false
}社群
證據
近期觀測
已驗證未記錄版本3 個工具