Concepts2
∑MathIntermediate
GCD and Euclidean Algorithm
The greatest common divisor (gcd) of two integers is the largest integer that divides both without a remainder.
#gcd#euclidean algorithm#extended euclidean+12
⚙️AlgorithmIntermediate
Pick's Theorem
Pick's Theorem connects area and lattice-point counts for any simple polygon with integer-coordinate vertices.
#pick's theorem#lattice polygon#shoelace formula+12