Math, asked by shristi15432, 7 months ago

state Euclid's division lemma​

Answers

Answered by avengersanirudh
2

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. ... HCF is the largest number which exactly divides two or more positive integers.

Step-by-step explanation:

PLEASE MARK ME AS BRAINLIEST

Answered by neerchaudhary9
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. The basis of the Euclidean division algorithm is Euclid's division lemma.

Similar questions