• 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 L.C.M of 2/15, 3/10, 6/5

8/5
7/5
6/5
2/3

ANSWER DOWNLOAD EXAMIANS APP

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

268
432
689
1015

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12,16, 18, 21, 28) + 7= 1008 + 7= 1015

Problems on H.C.F and L.C.M
Find the lowest common multiple of 24, 36 and 40.

120
480
360
240

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 2 | 24 - 36 - 40 -------------------- 2 | 12 - 18 - 20 -------------------- 2 | 6 - 9 - 10 ------------------- 3 | 3 - 9 - 5 ------------------- | 1 - 3 - 5 L.C.M. = 2 x 2 x 2 x 3 x 3 x 5 = 360.

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

220 hours
11 hours
12 hours
22 hours

ANSWER DOWNLOAD EXAMIANS APP

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

9831
9834
8739
9893

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A heap of coconuts is divided into groups of 2, 3 and 5 and each time one coconut is left over. The least number of Coconuts in the heap is?

41
51
31
61

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
↑