• HOME
  • QUIZ
  • CONTACT US
EXAMIANS
  • COMPUTER
  • CURRENT AFFAIRS
  • ENGINEERING
    • Chemical Engineering
    • Civil Engineering
    • Computer Engineering
    • Electrical Engineering
    • Mechanical Engineering
  • ENGLISH GRAMMAR
  • GK
  • GUJARATI MCQ

Problems on H.C.F and L.C.M

Problems on H.C.F and L.C.M
Find the highest common factor of 36 and 84.

16
12
34
22

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

36 = 2² x 3²84 = 2² x 3 x 7H.C.F. = 2² x 3 = 12.

Problems on H.C.F and L.C.M
L.C.M of two prime numbers x and y (x>y) is 161. The value of 3y-x is :

1
-2
-1
2

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The sum of two numbers is 528 and their H.C.F is 33. The number of pairs of numbers satisfying the above conditions is:

6
4
8
12

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A rectangular courtyard 3.78 metres long and 2.25 metres wide is to be paved exactly with square title, all of the same size. What is the largest size of the tile which could be used for the purpose

11 cms
42 cms
None of these
21 cms

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number when divided by 4, 5, 6, 8 and 10 leaves 3 as remainder?

121
112
116
123

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 The least number which when divided by 4,5,6,8 and 10 is the LCM of these numbers. But each time  to get 3 as remainder, we have to add the remainder 3 to the obtained LCM.LCM of (4, 5, 6, 8, 10)+ 3=120+3=123

Problems on H.C.F and L.C.M
The largest four – digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case, is

9893
8739
9831
9834

ANSWER DOWNLOAD EXAMIANS APP
MORE MCQ ON Problems on H.C.F and L.C.M

DOWNLOAD APP

  • APPLE
    from app store
  • ANDROID
    from play store

SEARCH

LOGIN HERE


  • GOOGLE

FIND US

  • 1.70K
    FOLLOW US
  • EXAMIANSSTUDY FOR YOUR DREAMS.
  • SUPPORT :SUPPORT EMAIL ACCOUNT : examians@yahoo.com

OTHER WEBSITES

  • GUJARATI MCQ
  • ACCOUNTIANS

QUICK LINKS

  • HOME
  • QUIZ
  • PRIVACY POLICY
  • DISCLAIMER
  • TERMS & CONDITIONS
  • CONTACT US
↑