• 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 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
910
91
1001

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
99
109

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Other number = 11 X 693   = 99                              77                            

Problems on H.C.F and L.C.M
The greatest number which on dividing 1657 and 2037 leaves remainders 6 and 5 respectively, is:

127
128
125
126

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (1657 - 6) and (2037 - 5)= H.C.F. of 1651 and 2032 = 127.

Problems on H.C.F and L.C.M
The product of two digits number is 2160 and their HCF is 12. The numbers are:

(12,180)
(36,60)
(72,30)
(96,25)

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Let the least 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:

6
3
4
5

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the Greatest Number that will devide 43, 91 and 183 so as to leave the same remainder in each case

4
13
9
7

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
↑