• 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 greatest possible length which can be used to measure exactly the length 4 m 95 cm . , 9 m and 16 m 65 cm.

45 cm.
42 cm.
55 cm.
35 cm

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The product of two numbers is 1320 and their H.C.F. is 6. the L.C.M. of the numbers is:

1314
7920
220
1326

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the least number when divided by 4, 5, 6, 8 and 10 leaves 3 as remainder?

116
123
121
112

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 The least number which when divided by 4,5,6,8 and 10 is the LCM of these numbers. But each time  to get 3 as remainder, we have to add the remainder 3 to the obtained LCM.LCM of (4, 5, 6, 8, 10)+ 3=120+3=123

Problems on H.C.F and L.C.M
If the sum of two numbers is 55 and the H.C.F and L.C.M of these numbers are 5 and 120 respectively, then the sum of the reciprocal of the numbers is equal to:

11/120
120/11
55/601
601/55

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Let the leas number of six digits. which when divided by 4, 6, 10 and 15 leaves in each case the same remainder of 2 be N. The sum of the digits in N is

5
3
4
6

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the greatest number which divides 29, 32, 38 and leaves same remainder in each case?

5
4
2
3

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
↑