• 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 number which on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

133
131
129
127

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

12
48
108
84

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The HCF of 2 numbers is 11 and LCM is 693.If one of numbers is 77.find the other number ?

97
98
100
99

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of two numbers= HCF x  LCM                        77 x a = 11 x 693Other number a  = (11×693)/77 = 99.

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 :

4
6
5
3

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the L.C.M.. of 72, 108 and 2100.

38600
38000
37800
37000

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The sum of two numbers is 528 and their H.C.F is 33. The number of pairs of numbers satisfying the above conditions is:

12
6
4
8

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
↑