Question

find HCF of 6824 , 980 by Euclid's method​

Answer 1

Answer:

This is more commonly known as "Greatest Common Divisor", or gcd(a,b).

980 = 1 × 504 + 476

504 = 1 × 476 + 28

476 = 17 × 28 + 0

So gcd(504,980) = 28.

Hope it helps friend

Answer 2

You need not to worry. It is removed from syllabus