math_gcd_lcm_calculator
Compute the greatest common divisor and least common multiple of any list of integers using the Euclidean algorithm. Provides prime factorization with step-by-step output.
Instructions
Menu ID: gcd_lcm_calculator. GCD / LCM Calculator. Compute the greatest common divisor and least common multiple of any list of integers using the Euclidean algorithm, plus prime factorization with step-by-step output. Use describe_tool with tool_id "gcd_lcm_calculator" for full page guidance.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| operation | Yes | ||
| numbers | Yes |