Question

2. Use Euclid's division algorithm to find the HCF of
(i) 135 and 225 (ii) 196 and 38220
(v) 184, 230 and 276 (v) 136, 170 and 255

PLZ GIVE ANSWER OF (IV)PART
FAST IF U WANT TO MARK UR ANSWER AS BEST OR BRAINLIST.
​

Answer 1

(iv) Given integers are 184, 230 and 276.

Let us first find the HCF of 184 and 230 by Euclid lemma.

Clearly, 230 > 184. So, we will apply Euclid’s division lemma to 230 and 184.

230 = 184 × 1 + 46

Remainder is 46 which is a non-zero number. Now, apply Euclid’s division lemma to 184 and 46.

184 = 46 × 4 + 0

The remainder at this stage is zero. Therefore, 46 is the HCF of 230 and 184.

Now, again use Euclid’s division lemma to find the HCF of 46 and 276.

276 = 46 × 6 + 0

The remainder at this stage is zero. Therefore, 46 is the HCF of 184, 230 and 276.

Follow me ✌✌✌✌

Answer 2

Heya...

Solution:⬆️⬆️

Hope its help....

Mark my ans as brainliest if its helpful to u...✌✌

&Follow me...