Euclid's Lemma

For any two integers and , suppose . Then if is relatively prime to , then divides . This results appeared in Euclid's Elements, Book VII, Proposition 30.

This result is incorrectly termed "Gauss's lemma," which is an entirely different result, by Séroul (2000, pp. 10-11).

Explore with Wolfram|Alpha

More things to try:

19-gon
common divisors of 360 and 96
hexagon, perimeter=100

References

Séroul, R. "Gauss's Lemma." §2.4.2 in Programming for Mathematicians. Berlin: Springer-Verlag, pp. 10-11, 2000.

Referenced on Wolfram|Alpha

Euclid's Lemma

Cite this as:

Weisstein, Eric W. "Euclid's Lemma." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/EuclidsLemma.html

Euclid's Lemma

Explore with Wolfram|Alpha

References

Referenced on Wolfram|Alpha

Cite this as:

Subject classifications