History


Help on query formulation
Euclid’s lemma revisited. (English)
Normat 58, No. 4, 184 (2010).
Summary: A minimal’ proof of the fact that a prime $p$ dividing $ab$ divides at least one of the factors $a$, $b$ is presented without invoking the Euclidean algorithm.
Classification: F65
Keywords: primes; prime factors
Valid XHTML 1.0 Transitional Valid CSS!