Question

divide 1026 with 14 and apply Euclid divide Lemma​

Answer 1

Answer:

so Here is Your Answer with details

Step-by-step explanation:

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.

In simple words, Euclid's Division Lemma is what you were using to check the accuracy of division in lower classes, which is Dividend = Divisor × Quotient + Remainder. When we divide a=39 by b=5, we get the quotient as q=7 and the remainder as r=4. Here is an example:

Euclid's Division Lemma

Thus, by Euclid's division lemma, 39 = 5 × 7 + 4.

What is Euclid's Division Algorithm?

Euclid’s Division Algorithm is the process of applying Euclid’s Division Lemma in succession several times to obtain the HCF of any two numbers.