Question

Find the HCF of 550 and 735,by Euclid division algorithm​

Answer 1

Answer:

Step 1: Since 735 > 550, we apply the division lemma to 735 and 550, to get

735 = 550 x 1 + 185

Step 2: Since the reminder 550 ≠ 0, we apply division lemma to 185 and 550, to get

550 = 185 x 2 + 180

Step 3: We consider the new divisor 185 and the new remainder 180, and apply the division lemma to get

185 = 180 x 1 + 5

We consider the new divisor 180 and the new remainder 5, and apply the division lemma to get

180 = 5 x 36 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 5, the HCF of 550 and 735 is 5

Notice that 5 = HCF(180,5) = HCF(185,180) = HCF(550,185) = HCF(735,550) .

Answer 2

Answer:

Hey

Step-by-step explanation:

$735 = 550 \times 1 + 185 \\ 550 = 185 \times 2 + 180 \\ 185 = 180 \times 1 + 5 \\ 180 = 5 \times 36 + 0$

so ,5 is the hcf of 550 and 735