Question

Using Euclid division algorithm find HCF of 243 and 625 verify that LCM*Hcf =product of two numbers

Answer 1

by euclid"s division lemma,

625=243×2+139
243=139×1+104
139=104×1+35
104=35×2+34
35=34×1+1
34=1×34+0
hence the hcf is 1

for lcm= product of no./hcf
           =243×625=151875

verification:-

hcf×lcm= product of two no.

1×151875=243×625
151875=151875

verified

Answer 2

Answer:

The HCF is 1

Step-by-step explanation:

We have to find the hcf of 84 and 105 by using euclid theorem.

In this Euclid algorithm we have to divide the bigger number by smaller number and workout with the remainder and continue to apply the process until we get the remainder any more.

625=243×2+139

243=139×1+104

139=104×1+35

104=35×2+34

35=34×1+1

34=1×34+0

Hence, the HCF is 1

Verification,

243 = 3 × 3 × 3 × 3 × 3

625 = 5 × 5 × 5 × 5

∴ LCM=243×625=151875

hcf×lcm= product of two no.

1×151875=243×625

151875=151875

Hence, verified