• 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
Reduce 391/667 to lowest terms .

31/45
23/37
17/29
11/13

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

H.C.F. of 391 and 667 is 23.On dividing the numerator and denominator by 23, we get :391 = 391 ¸23 = 17667    667¸ 23    29

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

22 hours
11 hours
220 hours
12 hours

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least square number which is divisible by 10, 12, 15 and 18?

3600
1600
2500
900

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 26, 36 and 46 leaves the remainders 12, 22 and 32 respectively.

10075
17050
10570
10750

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A gardener was asked a plant flowers in a row containing equal number of plants. He tried to plant 6, 8, 10 and 12 in each row, but 5 plants left in each case. When he planted 13 in a row, no plant wa

245
845
125
485

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 16, 18, 20 and 2 leaves 4 as remainder in each case , but when divided by 7 leaves no. remainder

18000
18002
18004
17004

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
↑