the HCF of smallest prime number and smallest non prime numbers is
(A)-- 1
(B)-- 2
(C)-- 4
(D)-- 8
Answers
Answered by
0
Answer:
1
Step-by-step explanation:
smallest prime number =2
and non prime number=1
Answered by
2
Answer:
Smallest prime number = 2
Smallest non-prime number = 9
HCF of 2 and 9
By Euclid Division Lemma or algorithm
step 1 :- a = 9 ; b = 2
By Euclid Division Lemma
a = bq + r
9 = 2 × 4 + 1
step 2 :- a = 2 ; b = 1
By Euclid Division Lemma
a = bq + r
2 = 1 × 2 + 0
Remainder ( r ) = zero ( 0 ) then
HCF = 1
Step-by-step explanation:
So ,
Option (A) 1 is correct .
Similar questions