Using Euclid's division algorithm, find the HCF of 1650 and 847.

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is B
11

Euclid's division algorithm to find HCF of 1650 and 847:
Step 1: 1650 = 847 $\times$ 1 + 803
Step 2: 847 = 803 $\times$ 1 + 44
Step 3: 803 = 44 $\times$ 18 + 11
Step 4: 44 = 11 $\times$ 4 + 0

Hence, 11 is the HCF of 1650 and 847.

Suggest Corrections

Similar questions

867

225

Using Euclid's division algorithm, find the HCF of 1650 and 847.

Using euclids division algorithm find whether 847 and 2160 are co prime or not.

441, 567, 693.

Join BYJU'S Learning Program