Question

Please Answer My question I will mark u as BRAINLIEST !

​

Answer 1

Answer:

Euclid's Division Algorithm :

According to Euclid, if a = bq + r then c | a, c | b and c | r. This means that c (any integer) can divide a, b and r.

Step-by-step explanation:

HCF of 24 and 33 are as follows,

Step 1 : 33 = 24 × 1 + 9

Here 24 will become dividend and 9 as divisor in next step.

Step 2 : 24 = 9 × 2 + 6

Step 3 : 9 = 6 × 1 + 3

Step 4 : 6 = 3 × 2 + 0

Finally we obtained r = 0 when divisor is 3 with 6 as dividend and 2 quotient.

The last divisor with which r becomes 0 is said to be H.C.F. Hence 3 ia largest common factor for 24 and 33.