Define Euclid devision lemma
Answers
Answered by
2
hey mate
⬇⬇⬇⬇⬇⬇
here is ur answer
⬇⬇⬇⬇⬇⬇⬇
the formula of Euclid decision lemma
⬇⬇⬇⬇⬇⬇⬇
A=Bq+r
WHERE A IS GREATER NUMBER AND B IS SMALLER NUMBER
AT LAST WHEN R =O THEN B IS THE HCF OF NUMBER
⬇⬇⬇⬇⬇⬇
here is ur answer
⬇⬇⬇⬇⬇⬇⬇
the formula of Euclid decision lemma
⬇⬇⬇⬇⬇⬇⬇
A=Bq+r
WHERE A IS GREATER NUMBER AND B IS SMALLER NUMBER
AT LAST WHEN R =O THEN B IS THE HCF OF NUMBER
Answered by
2
According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and rwhich satisfies the condition a = bq + rwhere 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 bwe use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.
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 bwe use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. By exactly we mean that on dividing both the integers a and b the remainder is zero.
Similar questions