• 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 largest number which divides 62,132,237 to leave the same reminder

30
25
35
None of these

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Trick is HCF of (237-132), (132-62), (237-62)= HCF of (70,105,175) = 35

Problems on H.C.F and L.C.M
1095/1168 when expressed in simplest form is:

13/16
25/26
15/16
17/26

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least which when divided y 16,18,20, and 25 leaves 4 as remainder in each case, but when divided by 7 leaves no remainder.

18002
17004
18004
18000

ANSWER DOWNLOAD EXAMIANS APP

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?

25
21
23
27

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
Find the greatest number that, while dividing 47, 215 and 365, gives the same remainder in each case?

5
6
3
4

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

7 : 27 : 12 hrs.
8 : 27 : 12 hrs.
6 : 27 : 12 hrs.
5 : 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
↑