Module rdcl_aoc_helpers::math

Math.

Functions

bezout_coefficients	Find t and s, such that ta + sb = gcd(p, q).
gcd	Computes the greatest common divisor for numbers a and b.
lcm	Computes the least common multiple of a and b.
solve_crt	Solve the chinese remainder theorem for (n1, a1) and (n2, a2). We assume that: