Category:GCD of Integers with Common Divisor
Jump to navigation
Jump to search
This category contains pages concerning GCD of Integers with Common Divisor:
Let $a, b \in \Z$ be integers such that not both $a = 0$ and $b = 0$.
Let $k \in \Z_{>0}$ be a strictly positive integer.
Then:
- $\gcd \set {k a, k b} = k \gcd \set {a, b}$
where $\gcd$ denotes the greatest common divisor.
Pages in category "GCD of Integers with Common Divisor"
The following 6 pages are in this category, out of 6 total.