• 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
Three numbers are in the ratio 1 : 2 : 3 and their H.C.F is 12. The numbers are

5, 10, 15
12, 24, 36
4, 8, 12
10, 20, 30

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three men start together to travel the same way around a circular track of 11 kilometers in circumference. Their speeds are 4, 5 and 8 kilometers per hour respectively. When will they meet at a starti

11 hours
12 hours
220 hours
22 hours

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The Smallest number which when diminished by 7, is divisible by 12,16,18,21 and 28 is :

1015
1008
1032
1022

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A room is 4 meters 37 cm long and 3 meters 23cm broad. It is required to pave the floor with minimum square slabs. Find the number of slabs required for this purpose?

391
431
485
381

ANSWER DOWNLOAD EXAMIANS APP

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:

126
128
127
125

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
Find the greatest number that will divided 43,91 and 183 so as to leave the same remainder in each case

4
9
13
7

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
↑