• 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
Let the least number of six digits, which when divided by 4, 6, 10 and 15, leaves in each case the same remainder of 2, be N. The sum of the digits in N is:

3
5
4
6

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

133
127
131
129

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

In this type of question, its obvious we need to calculate the HCF, trick isHCF of (1661 - 10) and (2045 -13)= HCF (1651, 2032) = 127

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that sum is divisible by 5, 6, 4, 3?

23
27
25
21

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 5,6,4,3 is 60.On dividing 2497 by 60 we get 37 as remainder.Therefore number to be added is 60 - 37 =23.

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

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

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
LCM of 455, 117, 338 is:

10670
106470
107470
104670

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of 1.75, 5.6 and 7 is:

3.5
0.07
0.7
0.35

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
↑