◀ ▲ ▶Branches / Number-theory / Proposition: Generating Co-Prime Numbers Knowing the Greatest Common Divisor
Proposition: Generating Co-Prime Numbers Knowing the Greatest Common Divisor
If \(d\) is the greatest common divisor of two integers \(a\) and \(b\), then the integers \(\frac ad\) and \(\frac bd\) are co-prime, formally
\[d=\gcd(a,b)\Rightarrow \frac ad\perp \frac bd.\]
Table of Contents
Proofs: 1
Mentioned in:
Proofs: 1 2 3
Thank you to the contributors under CC BY-SA 4.0! 
- Github:
-
References
Bibliography
- Landau, Edmund: "Vorlesungen über Zahlentheorie, Aus der Elementaren Zahlentheorie", S. Hirzel, Leipzig, 1927
