Skip to main content
Glama

author:s-b-e-n-s-o-n MCP tools

Production-ready MCP servers that extend AI capabilities through file access, database connections, APIs, and contextual services.

50,274 tools. Last updated 2026-01-01 09:36
  • Calculate Euler's number (e) using the mathematical limit definition e = lim(n→∞) (1 + 1/n)^n by specifying the n value for approximation.
    MIT License
  • Calculate Lucas U_n and V_n sequences using parameters P and Q to solve recursive sequence problems in mathematical computations.
    MIT License
  • Calculate Euler's totient function φ(n) to determine the count of integers up to n that are coprime with n.
    MIT License
  • Generate the first n s-gonal numbers to explore figurate number sequences in arithmetic. Specify n for count and s for polygon sides.
    MIT License
  • Test if an integer is prime using Wilson's theorem: (n-1)! ≡ -1 (mod n) for prime numbers. Enter an integer to verify its primality.
    MIT License

Interested in MCP?

Join the MCP community for support and updates.

RedditDiscord

Matching MCP servers