calculate_gcd_lcm
Calculate the greatest common divisor (GCD) and least common multiple (LCM) of two integers using the Euclidean algorithm.
Instructions
Calculate GCD (PGCD) and LCM (PPCM) of two integers using Euclidean algorithm. Returns: {gcd, lcm}. See list_bundles for related 'math' calculators.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | First integer | |
| b | Yes | Second integer |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | No | Computed result. Object whose fields depend on the tool (e.g. {tax, marginal_rate, brackets} for tax tools, {volume_l, gallons} for volume tools). | |
| formula | No | Human-readable formula or method used (e.g. "I=P·r·t", "Magnus formula"). | |
| source | No | Authoritative source for the rule or formula (e.g. "Article 197 CGI", "NF DTU 21"). | |
| reference_url | No | Link to a calcul2 page documenting the calculation in detail. |