• 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
What will be the LCM of 8, 24, 36 and 54

216
345
112
444

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 8-24-36-54 will be2*2*2*3*3*3 = 216

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:

124
64
260
156

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
L.C.M. of two prime numbers x and y (x > y) is 161 The value of 3y – x is:

1
-2
2
-1

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 6,7,8,9, and 12 leave the same remainder 1 each case

505
707
404
606

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

  3 |  6 - 7  - 8  - 9 - 12-----------------------------  4 | 2  - 7  - 8  - 3 - 4  ---------------------------   2 | 2  - 7  - 2  - 3 - 1 --------------------------     | 1  - 7  - 1  - 3 - 1 L.C.M = 3 X 2 X 2 X 7 X 2 X 3 = 504.Hence required number = (504 +1) = 505   

Problems on H.C.F and L.C.M
Find the highest common factor of 36 and 84.

34
16
22
12

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

36 = 2² x 3²84 = 2² x 3 x 7H.C.F. = 2² x 3 = 12.

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

2 x 2 x 2 x 3 x 7
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

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

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

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
↑