• 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
The least number of four digits which is divisible by 4, 6, 8 and 10 is?

1075
1095
1085
1080

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:

1911
91
910
1001

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divide by 2, 3, 4, 5 and 6 leaves 1, 2, 3, 4 and 5 as remainders respectively, but when divided by 7 leaves no remainder?

210
126
154
119

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The largest four-digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case,is :

9831
8739
9893
9834

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number which on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

133
131
127
129

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

In this type of question, its obvious we need to calculate the HCF, trick isHCF of (1661 - 10) and (2045 -13)= HCF (1651, 2032) = 127

Problems on H.C.F and L.C.M
Find the least number which when divided by 35 leaves remainder 25, when divided by 25 leaves remainder 15 and when divided by 15 leaves remainder 5?

435
420
515
518

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
↑