gcd_lcm
Compute the greatest common divisor and least common multiple for two or more integers, such as [12, 18, 24].
Instructions
Return the greatest common divisor and least common multiple.
Accepts two or more integers, e.g. [12, 18, 24].
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_lcm"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| numbers | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||