Euclid's lemma/Definition
Jump to navigation
Jump to search

A prime number that divides a product of two integers must divide one of the two integers.
![]() |
Main Article |
Discussion |
Related Articles [?]
|
Bibliography [?]
|
External Links [?]
|
Citable Version [?]
|
||||||||||||||
|
A prime number that divides a product of two integers must divide one of the two integers.