Calculate Bézout coefficients to find integers x and y satisfying ax + by = gcd(a,b) for given integers a and b.
Apache 2.0
112,329 tools. Last updated 2026-04-20 02:38
- Search official Onyx programming language documentation to find answers and code examples for development questions.
- Retrieve available compilers for a programming language to enable code compilation and optimization analysis.
- Solve systems of linear equations (Ax = b) using SciPy's optimized solver for square or overdetermined systems.MIT
- Find integer solutions for linear Diophantine equations of the form ax + by = c. This tool calculates all possible integer pairs (x, y) that satisfy the equation.Apache 2.0
- Discover and analyze code patterns across programming languages within a knowledge graph. Filter results by language or pattern name to enhance code understanding and retrieval.MIT
Matching MCP Servers
- -securityAlicense-qualityA dedicated MCP server for interacting with Microsoft Dynamics 365 and Dataverse tools via the g-gremlin CLI. It enables users to read, analyze, and perform write operations on Dataverse environments through supported MCP clients.Last updatedMIT
- AsecurityFlicenseAqualityAn MCP server that provides AI agents with full access to the X (Twitter) API for posting, searching, and managing engagement through natural language. It supports comprehensive tools for tweet management, media uploads, and account analytics across multiple MCP-compatible clients.Last updated1539
Matching MCP Connectors
- ax-platformOAuth
The Resident Mind gateway. Persistent identity, shared context, workspace-wide AI.
Official Microsoft Learn MCP Server – real-time, trusted docs & code samples for AI and LLMs.