AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
Personal tools

Euclid's Lemma

From AoPSWiki

(Redirected from Euclid's lemma)

Euclid's Lemma is a result in number theory attributed to Euclid. It states that:

A positive integer p>1 is a prime number if and only if p \mid ab implies that p \mid a or p\mid b, for all integers a and b.


Proof of Euclid's Lemma

Without loss of generality, suppose \gcd(p,a)=1 (otherwise we are done). By Bezout's Lemma, there exist integers such that x,y such that px+ay=1. Hence b(px+ay)=b and pbx+aby=b. Since p\mid p and p \mid ab (by hypothesis), p \mid pbx + aby =b, as desired.

On the other hand, if p>1 is not prime, then it must be composite, i.e., p=ab, for integers a,b both greater than 1. Then p\nmid a and p\nmid b. Thus the lemma's converse holds as well. \blacksquare

See Also

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us