GCD from Prime Decomposition/Examples/p^2 q and p q r
Jump to navigation
Jump to search
Example of Use of GCD from Prime Decomposition
The greatest common divisor of $p^2 q$ and $p q r$, where $p$, $q$ and $r$ are all primes, is:
- $\gcd \set {p^2 q, p q r} = p q$
Proof
\(\ds p^2 q\) | \(=\) | \(\ds p^2 q^1 r^0\) | ||||||||||||
\(\ds p q r\) | \(=\) | \(\ds p^1 q^1 r^1\) | ||||||||||||
\(\ds \leadsto \ \ \) | \(\ds \gcd \set {p^2 q, p q r}\) | \(=\) | \(\ds p^1 q^1 r^0\) | |||||||||||
\(\ds \) | \(=\) | \(\ds p q\) |
$\blacksquare$
Sources
- 1971: George E. Andrews: Number Theory ... (previous) ... (next): $\text {2-4}$ The Fundamental Theorem of Arithmetic: Exercise $6 \ \text{(f)}$