greatest_common_divisor
Computes the greatest common divisor (GCD) of two non-negative integers using the Euclidean algorithm. (cost: 1 credit)
Tool call template
This tool declares no required parameters. Add optional parameters from the input schema as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {},
"name": "greatest_common_divisor"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | No | integer, required, the first non-negative integer | |
| b | No | integer, required, the second non-negative integer |