• 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 sum of two numbers is 528 and their H.C.F is 33. The number of pairs of numbers satisfying the above condition is

6
8
12
4

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

127
131
129
133

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 which when divided y 16,18,20, and 25 leaves 4 as remainder in each case, but when divided by 7 leaves no remainder.

18002
17004
18000
18004

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respestively.

3024
3002
3036
3013

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least square number which divides 8, 12 and 18 is?

100
144
64
121

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
If LCM of two number is 693, HCF of two numbers is 11 and one number is 99, then find other

77
88
66
55

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Product of two numbers = Product of their HCF and LCMSo Other number =(693×11/99)                              = 77

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
↑