Skip to main content
Glama
IBM

MCP Math Server

by IBM

euler_totient

Calculate Euler's totient function φ(n) to determine the count of integers up to n that are coprime with n.

Instructions

Calculate Euler's totient function φ(n) - count of integers ≤ n coprime to n. (Domain: arithmetic, Category: arithmetic_functions)

Input Schema

TableJSON Schema
NameRequiredDescriptionDefault
nYes

Tool Definition Quality

Score is being calculated. Check back soon.

Install Server

Other Tools

Latest Blog Posts

MCP directory API

We provide all the information about MCP servers via our MCP API.

curl -X GET 'https://glama.ai/api/mcp/v1/servers/IBM/chuk-mcp-math-server'

If you have feedback or need assistance with the MCP directory API, please join our Discord server