Prove these are relatively prime. (involving Greatest Common Divisor) 
I know that we have to use prime factorization.
$\gcd(\alpha,\beta)$ => using minimum
$\text{lcm}(\alpha,\beta)$ => using maximum
$$\gcd(\alpha,\beta) \times \text{lcm}(\alpha,\beta) = a * b$$
How do I continue or any tips?
Thank You.

$$\gcd(a',b') = \gcd\left(\frac{a}{\gcd(a,b)},\frac{b}{\gcd(a,b)}\right) = 1$$
