Question

Define Euclid division lemma..
Do fast i mark as BRAINLIEST..

Answer 1

Answer:

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

Answer 2

Answer:

Step-by-step explanation:

Euclid lemma is a lemma that captures a fundemental property of prime numbers namely Euclids formula. If a prime p divides the product ab of 2 integers a and b, then p must divide atleast one of those integers a and b