Function default

default(a: number, b: number): number
Calculates the Greatest Common Divisor (GCD) of two numbers using the Euclidean algorithm.

This function is essential for simplifying fractions throughout the maqam analysis system. It uses the Euclidean algorithm with floating-point precision handling to ensure accurate results even with small decimal numbers.

The Euclidean algorithm works by repeatedly replacing the larger number with the remainder of the division until one number becomes effectively zero.
Parameters
- a: number
  First number (will be converted to absolute value)
- b: number
  Second number (will be converted to absolute value)
Returns number
The Greatest Common Divisor of a and b
Example
```
gcd(12, 8) // Returns 4
```
Example
```
gcd(15, 25) // Returns 5
```
Example
```
gcd(17, 13) // Returns 1 (coprime numbers)
```
- Defined in functions/gcd.ts:24