Question

state euclid's division lemma​

Answer 1

Answer:

Euclid division Lemma:

x

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. 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. That means, on dividing both the integers a and b the remainder is zero.

Let us consider two numbers 78 and 980.

980 = 78× 12+ 44

78 = 44 × 1 +34

44 = 34 × 1 + 10

34 = 10 × 3 + 4

10 = 4 × 2 + 2

4 = 2 × 2 + 0

Until r =0 we have continue this process.

Mark Brainliest if it helps you..❣️

Answer 2

Answer:

answer

Step-by-step explanation:

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

mark me beainliest