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

41
51
31
61

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when divided by 8, 12 and 16, leave in each remainder 3, is?

70
51
71
69

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
1022
1032

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest possible length which can be used to measure exactly the lengths 4 m 95 cm, 9 m and 16 m 65 cm.

35 cm
55 cm
25 cm
45 cm

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required length = H.C.F. of 495 cm, 900 cm and 1665 cm.          495 = 3² x 5 x 11, 900 = 2² x 3² x 5², 1665 = 3² x 5 x 37.      H.C.F. = 32 x 5 = 45.          Hence, required length = 45 cm.

Problems on H.C.F and L.C.M
The product of two numbers is 2025 and their HCF is 15 their LCM is:

150
2010
2040
135

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 693. If one of the numbers is 77,find the other.

89
79
109
99

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = 11 X 693   = 99                              77                            

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
↑