pyaesthetics.quadtreedecomposition.closest_common_divisor

pyaesthetics.quadtreedecomposition.closest_common_divisor(n, m, k)

Find the common divisor of n and m that is closest to k.

Parameters:

• n (int) – First number.

• m (int) – Second number.

• k (int) – Target value.

Returns:

The common divisor closest to k.

Return type:

int