gcd_lcm
Compute the greatest common divisor, least common multiple, or step-by-step Euclidean algorithm for two or more numbers.
Instructions
Compute GCD, LCM, or Euclidean algorithm steps.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| numbers | Yes | ||
| operation | No | gcd | |
| extended | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||