• 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
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:

125
128
126
127

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 2032 = 127.

Problems on H.C.F and L.C.M
The HCF of 2 numbers is 11 and LCM is 693.If one of numbers is 77.find the other number ?

97
98
100
99

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of two numbers= HCF x  LCM                        77 x a = 11 x 693Other number a  = (11×693)/77 = 99.

Problems on H.C.F and L.C.M
The smallest number when increased by " 1 " is exactly divisible by 12, 18, 24, 32 and 40 is:

1439
1449
1440
1459

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The product of two numbers is 1320 and their H.C.F. is 6. the L.C.M. of the numbers is:

7920
220
1326
1314

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest fraction, which each of 6/7, 5/14, 10/21 will divide exactly is:

30/7
60/147
50/294
30/98

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The traffic light at three different road crossing change after every 48 sec, 72 sec. and 108 sec. respectively . If they all change simultaneously at 8 : 20 : 00 hours, then at what time will they ag

6 : 27 : 12 hrs.
5 : 27 : 12 hrs.
7 : 27 : 12 hrs.
8 : 27 : 12 hrs.

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
↑