Answer:
10
Explanation:
According to Euclid's Algorithm, c = dq + r , 0 ≤ r < d (where r is the remainder)
As 70 > 50, c = 70 and d = 50
Substituting values of c and d:
70 = (50 x 1) + 20
⇒ 50 = (20 x 2) + 10
⇒ 20 = (10 x 2) + 0
Therefore, the HCF is 10