Euclid's Lemma/Proof 1

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $a, b, c \in \Z$.

Let $a \divides b c$, where $\divides$ denotes divisibility.


Let $a \perp b$, where $\perp$ denotes relative primeness.

Then $a \divides c$.


Proof

Follows directly from Integers are Euclidean Domain.

$\blacksquare$



Source of Name

This entry was named for Euclid.


Also see