Question

State Euclid 's Division Lemma. ​

Answer 1

$\huge\tt\red{A}\tt\pink{N}\tt\blue{S}\tt\green{W}\tt\purple{E}\tt\orange{R}\tt\orange{}\huge\tt\red{}\orange{~~:}$

Euclid’s division lemma is a proven statement which is used to prove other statements in the branch of mathematics. The basis of Euclidean division algorithm is Euclid’s division lemma. To calculate the Highest Common Factor (HCF) of two positive integers x and y, Euclid’s division algorithm is used.

Answer 2

$. \huge\color{purple}\boxed{\colorbox{white}{Answer}}$

Euclid's Division Lemma (lemma is like a theorem) says that given two positive integers a and b, there exist unique integers q and r such that a = bq + r, 0≤ r <b. The integer q is the quotient and the integer r is the remainder. The quotient and the remainder are unique.