• 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 that will divide 43, 91 and 183 so as to leave the same remainder in each case.

4
6
2
8

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = H.C.F. of (91 - 43), (183 - 91) and (183 - 43)                                 = H.C.F. of 48, 92 and 140 = 4.

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:

8
6
4
12

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

66
77
55
88

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

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

Problems on H.C.F and L.C.M
HCF and LCM two numbers are 12 and 396 respectively. If one of the numbers is 36, then the other number is?

36
132
264
66

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
252 can be expressed as a product of primes as:

2 x 3 x 3 x 3 x 7
3 x 3 x 3 x 3 x 7
2 x 2 x 3 x 3 x 7
2 x 2 x 2 x 3 x 7

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Clearly, 252 = 2 x 2 x 3 x 3 x 7.

Problems on H.C.F and L.C.M
The greatest number which can divide 1356,1868 and 2764 leaving the same remainder 12 in each case, is :

260
64
124
124

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
↑