• 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
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?

61
41
51
31

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
he maximum number of students among them 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and same number of pencils is:

910
1911
91
1001

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?

381
431
391
485

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the HCF of 54, 288, 360

16
18
19
17

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Lets solve this question by factorization method.18=2×3²,288=2×2×2×2×2×3²,360=2³×3²×5So HCF will be minimum term present in all three, i.e.2×3²=18

Problems on H.C.F and L.C.M
The H.C.F of two numbers is 8. Which of the following can never be their L.C.M?

60
24
48
56

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

15120
11115
15210
15110

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
↑