Math, asked by sunilkukreti75, 10 months ago

Use Euclid division lemma algorithm to find the hcf of 2062 and 6788

Answers

Answered by shray04
0

Answer:

divide 6788 and 2062

hen whatever is the remainder divide it with the divisor and continue this itll the remainder comes zero

Step-by-step explanation:

Answered by Dharanibojja11
1

Answer:

Hcf of 2062 and 6788

using euclid's division lemma

a=bq+r

6788=2062*21+602

2062=602*3+256

602=256*2+90

256=90*2+76

90=76*1+14

76=14*5+6

14=6*2+2

6=2*3+0

HCF=2

Hope this answer helps u....

Similar questions