Question

Find the HCF of 505 and 25 by Euclid's division Alogritm

Answer 1

$\huge \bold{hello \: mate}$

505=25×20+5

25=5×5+0

Since remainder=0, the process of division stops.

Here the divisor is 5.

↪HCF(505,25)=5

Answer 2

Answer:

Euclid Division Algorithm:

According to Euclid's division algorithm, any positive integer a can be expressed as a = bq + r

where q is quotient, b is divisor and r is remainder, 0 ≤ r < b.

It is a technique used to find the highest common factor of two positive integers. HCF is largest number which divides both integers until remainder is zero.

Out of the two given numbers, we consider the greater number first and then follow Euclid's algorithm.

Now, here 980 is the greatest number among the given numbers.

As, the remainder is 0, 28 will be the greatest common divisor for the two given numbers.