MyQuestionIcon

4

You visited us 4 times! Enjoying our articles? Unlock Full Access!

Method of Finding HCF

Using Euclid'...

Question

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

A

10

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

B

11

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

C

12

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

D

27

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

thumbs-up

5

Similar questions

Q. Using Euclid's division algorithm find the HCF:

48250, 38540

Using euclid's division algorithm find whether the pair of numbers 847 and 2160 are co primes or not

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

The Fundamental Theorem of Arithmetic

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Method of Finding HCF

Standard X Mathematics

Join BYJU'S Learning Program

CrossIcon