gcd_calculate
Compute the greatest common divisor and least common multiple of an array of integers to solve number-theory and fraction-reduction tasks.
Instructions
Compute the greatest common divisor (GCD) and least common multiple (LCM) of integers.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"numbers": "<numbers>"
},
"name": "gcd_calculate"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| numbers | Yes | Array of integers (at least 2). |