{"name":"modular","title":"Modular Arithmetic (pow / inverse / gcd)","category":"math","description":"Modular exponentiation, modular inverse, and greatest-common-divisor computations.","price_usd":0.001,"input_schema":{"type":"object","properties":{"op":{"type":"string","description":"Operation","enum":["pow","inverse","gcd"]},"base":{"type":"integer","description":"Base (pow)"},"exponent":{"type":"integer","description":"Exponent (pow)"},"modulus":{"type":"integer","description":"Modulus (pow/inverse)"},"a":{"type":"integer","description":"Operand a (inverse/gcd)"},"b":{"type":"integer","description":"Operand b (gcd)"}},"additionalProperties":false,"required":["op"]}}