Question

find the HCF of the following using long division method 442 ki photos of work ​

Answer 1

Answer:

Step-by-step explanation:

Step I:  

Divide the large number by the smaller one.  

Step II:  

Then the remainder is treated as divisor and the divisor as dividend.

Step III:

Divide the first divisor by the first remainder.

Step IV:

Divide the second divisor by the second remainder.

Step V:

Continue this process till the remainder becomes 0.

Step VI:

The divisor which does not leave a remainder is the H.C.F. or G.C.D. of the two numbers and thus, the last divisor is the required highest common factor (H.C.F) of the given numbers.

Let us consider some of the examples to find highest common factor (H.C.F) by using division method.

By Euclid's Algorithm,

a = bq + r (where a > b)

Therefore, a = 1261 and b = 442.

1261 = 442 × 2 + 377

442 = 377 × 1 + 65

377 = 65 × 5 + 52

65 = 52 × 1 + 13

52 = 13 × 4 + 0

Hence, 0 remained as the reminder.

So, the HCF(1261,442) = 13

Hope it will help you.

Please mark me as brain list

BY Tolety roshan