Question

Using
Euclid's
algouthon, find HCF
of 2048 and 960​

Answer 1

Answer:

Euclid's division lemma

a=bq+r

2048=960×2+128

960=128×8+64

128=64×2+0

HCF of [2048,960]=64

Answer 2

AnsWer:-

♦Euclid's Algorithm♦

→a=bq+r

→2048=960×2+128

→960=128×7+64

→128=64×2+0

•64 is The HCF•

$\rule{200}{2}$