Question

Find the H.C.F of 24 and 33 by using euclid division algorithm

Answer 1

Answer:

Their H.C.F is 3.

Step-by-step explanation:

In division algorithm, we find the H.C.F. of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained( when the remainder is zero), Which is the H.C.F. of these two numbers.

Here, the given numbers,

24 and 33,

When we apply the division algorithmic, ( shown below )

We found that the exact divisor is 3,

Hence, the H.C.F.( 24, 33 ) = 3