• 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 product of the L.C.M. and H.C.F. of two numbers is 24. The difference of two numbers is 2. Find the numbers.

2 and 4
6 and 4
8 and 6
8 and 10

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 23 and the other two factors of their L.C.M. are 13 and 14. The larger of the two numbers is:

299
322
276
345

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Clearly, the numbers are (23 x 13) and (23 x 14). Larger number = (23 x 14) = 322.

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 0, 62,98 and 130 as remainders respectively is .

15110
15120
15210
11115

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Four bells begin to toll together respectively at the intervals of 8, 10, 12 and 16 seconds. After how many seconds will they toll together again?

242 seconds
243 seconds
240 seconds
246 seconds

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the largest number of four digits which is exactly divisible by 27,18,12,15

9720
10720
8720
11720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 27-18-12-15 is 540.After dividing 9999 by 540 we get 279 remainder.So answer will be 9999-279 = 9720

Problems on H.C.F and L.C.M
The greatest number that exactly divided 105, 1001 and 2436 is

3
21
7
11

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
↑