Question

find the h.c.f of 231 and 396

Answer 1

Approach 2. Euclid's algorithm:Step 1. Divide the larger number by the smaller one: 
396 ÷ 231 = 1 + 165;Step 2. Divide the smaller number by the above operation's remainder: 
231 ÷ 165 = 1 + 66;Step 3. Divide the remainder from the step 1 by the remainder from the step 2: 
165 ÷ 66 = 2 + 33;Step 4. Divide the remainder from the step 2 by the remainder from the step 3: 
66 ÷ 33 = 2 + 0;At this step, the remainder is zero, so we stop: 
33 is the number we were looking for, the last remainder that is not zero. 
This is the greatest common factor (divisor).

Answer 2

Prime factorization of 231 = 3 * 7 * 11

Prime factorization of 396 = 2 * 2 * 3 * 3 * 11

HCF(231,396) = 3 * 11

                        = 33.


Hope this helps!