Function symmetry::symm_igcd

Function Documentation

auto symmetry::symm_igcd(int a, int b) -> int

Computes the greatest common divisor of two integers.

Uses the Euclidean algorithm to find the greatest common divisor (GCD) of two integers.

Parameters:

  • a – First integer

  • b – Second integer

Returns:

Greatest common divisor of a and b