wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

The HCF of 455,42using Euclid algorithm is


A

7

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

6

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

5

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

4

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

The correct option is A

7


Euclid’s division lemma states that,

Any positive real number a can be represented asa=bq+rwhere b is greater than 0 and is called the divisor ofa and r is remainder obtained after dividinga by b

Given numbers are 455,42

So,

455 can be written as,

455=42x10+35

Using Euclid’s division algorithm on42,35, we get,

42=35x1+7

Again using Euclid’s division algorithm on 35,7, we get,

35=7x5+0

We get a 0 remainder. So we will stop using Euclid’s division algorithm

Since,7 is the last non-zero remainder

Hence, the HCF of 455,42is 7


flag
Suggest Corrections
thumbs-up
3
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Fundamental Theorem of Arithmetic
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon