# Greatest common divisor
Last edited: 2025-12-05
Greatest Common divisor
Let $x, y \in \mathbb{Z}$ then define the $gcd(x,y)$ to be the largest natural number $n \in \mathbb{N}$ such that $n \vert x$ and $n \vert y$.
Last edited: 2025-12-05
Let $x, y \in \mathbb{Z}$ then define the $gcd(x,y)$ to be the largest natural number $n \in \mathbb{N}$ such that $n \vert x$ and $n \vert y$.