Saved Bookmarks
| 1. |
What is eculid lemma |
|
Answer» For every two positive integers a,b there exists another two integers b and r such that a=bq+r Euclid\'s lemma is a lemma that captures a fundamental property of prime numbers, namely: Euclid\'s lemma - If a prime p divides the product ab of two integers a and b, p must divide at least one of those integers a and b. \u200eThe basis of Euclidean division algorithm is Euclid\'s division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b ,we use Euclid\'s division algorithm. HCF is the largest number which exactly divides two or more positive integers. a=bq+r |
|