Question

to find the hcf of two number experimentally based on euclid division lemma​

Answer 1

On Basis of Euclid division lemma

a=bq+r

1. Here, taking largest number as a and smallest as b
2. On it's dividing if r=0 then it is it's HCF
3. If not r is not equal to 0
4. Taking b as new dividend and r is new divisor
5. If it is possible then r is not equal to zero then taking b as new dividend and r as new divisor .
6. At last when r=0 then b is HCF of two number.

Answer 2

We can't find HCF by euclid division Lemma.
We can find HCF by using euclid's division algorithm. (ALGORITHM IS A APPLICATION OF EUCLID'S DIVISION LEMMA)
For example ;
QUESTION :
Find HCF of 8and6?
ANSWER :
apply euclid's division algorithm
a=b×q+r(0 is less than are equal to r, r is less than b)
a=dividend
b=divisor
q=quotient
r=reminder

Step 1 : 8=6×1+2
(now take b as a and r as b until r=0)
Step 2:6=2×3+0
( When you get 0 as reminder than the
divisor is the HCF)
SO, 2 is the HCF of 8 and 6

HOPE IT HELPS

MARK ME AS BRAINLIST ✌