• 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
LCM of 455, 117, 338 is:

107470
106470
10670
104670

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number, which when divided by 12, 15, 20 and 54 leaves in each case a remainder of 8 is:

389
548
216
443

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12, 15, 20, 54) + 8= 540 + 8= 548.

Problems on H.C.F and L.C.M
The H.C.F and L.C.M of two numbers are 84 and 21 respectively. If the ratio of the two numbers is 1 : 4 , then the larger of the two numbers is

84
48
108
12

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

12 hours
22 hours
220 hours
11 hours

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the HCF of 2.1, 1.05 and 0.63

3.21
2.21
1.21
0.21

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

To solve this question quickly, first remove decimal by multiplying each term with 100,Then terms become 210, 105, 63Then HCF of above terms is 21, So Answer is 0.21

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?

4
3
2
5

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
↑