Prime Number EngineをChatGPTとClaudeに接続

最速日

576ms

最遅日

989ms

14日間の傾向

遅延傾向+6%

Prime Number Engine Connector

準備完了です。MCPクライアントを選択し、セットアップ手順に従ってください。

コネクタリンクhttps://edge.vinkius.com/vk_preview_114Tf2OF9153g5Yf4TXZswn5YVnX9iTSz5jmXjKB/mcpコピー

Claude Desktop

以下の手順で数秒で接続できます。

1. 1In Claude Desktop, open Settings → Connectors.
2. 2Click “Add custom connector” and paste the connector link above as the remote MCP server URL.
3. 3Click Add and start a new chat — Prime Number Engine capabilities are ready to use.

設定 · claude_desktop_config.jsonコピー

{
  "mcpServers": {
    "prime-number-engine-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_114Tf2OF9153g5Yf4TXZswn5YVnX9iTSz5jmXjKB/mcp"
    }
  }
}

• Claude
• ChatGPT
• Cursor
• VS Code
• Windsurf
• Claude Code
• JetBrains
• Cline

各クライアントの手順ガイドはこちらです。 接続方法

Claude向けのガイド付きセットアップ？ Prime Number EngineをClaudeや他のAIに設定する

このConnectorが対応するすべてのAIクライアントを見る ↑

• 01

  数学研究者

  素数分布の解析や数論的性質の調査に使用します。

• 02

  暗号学エンジニア

  素数判定や素因数分解などの計算アルゴリズムの検証に活用します。

• 03

  データサイエンティスト

  数値計算アルゴリズムの実装や統計的データの解析に利用します。

• 01

  What algorithms does the primality test use?

  The test uses Trial Division, Deterministic Miller-Rabin, and Probabilistic Miller-Rabin methods.

• 02

  How does the factorization capability work?

  It uses trial division and Pollard's rho algorithm to find prime factors.

• 03

  Can I use this with Claude?

  Yes, you can use this MCP with any MCP-compatible client including Claude, Cursor, and Windsurf.

• 04

  What kind of statistical info can I get?

  You can get prime density info, including estimated prime counts and prime gap sizes.

• 05

  Does this MCP require a subscription?

  Vinkius hosts and manages the MCP, allowing you to subscribe and connect with one click.

• 06

  How accurate is the primality test?

  The engine uses Deterministic Miller-Rabin for numbers up to $3.3 \times 10^{24}$, providing 100% certainty. For larger numbers, the Probabilistic Miller-Rabin method is used with a configurable number of rounds to minimize error probability.

• 07

  What algorithm is used for factorization?

  The engine employs trial division up to the cube root of the target number, followed by Pollard's rho algorithm to efficiently find larger prime factors.

• 08

  Can I find primes near a specific large number?

  Yes, the find_adjacent_primes capability allows you to search for the next, previous, or both adjacent primes relative to any provided integer.

• 

  Prime Factorization, GCD & LCM Calculator AIコネクタ

  Compute exact prime factorizations and calculate GCD and LCM for sets of integers.

  表示
• 

  Algebraic Number Minimal Polynomial AIコネクタ

  Calculate minimal polynomials, verify roots, and analyze algebraic field extensions.

  表示
• 

  Algebraic Number Arithmetic AIコネクタ

  Exact arithmetic and comparison for algebraic numbers using minimal polynomials.

  表示
• 

  Formal Series Reversion Engine AIコネクタ

  Compute formal compositional inverses of univariate power series with precision verification.

  表示

おすすめ

• 

  Feature Scaler Engine AIコネクタ

  Standardize (Z-Score) or MinMax scale numeric columns with mathematical perfection local. Essential normalizat

  表示
• 

  Music Theory Chord Engine AIコネクタ

  Deterministic music theory calculator for precise chord structures and enharmonic spelling.

  表示
• 

  Natural Gas Compressibility Factor Engine AIコネクタ

  High-precision Z-factor calculations using industry-standard correlations.

  表示
• 

  Ada Lovelace Algorithmic Prover AIコネクタ

  Your AI said 'process the data' and called it an algorithm. That is not an algorithm — that is a wish. No step

  表示