• 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
Least perfect square number, exactly divisible by 21, 36 and 56 is?

441
7056
504
3600

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
If the sum of two numbers is 55 and the H.C.F and L.C.M of these numbers are 5 and 120 respectively, then the sum of the reciprocal of the numbers is equal to:

601/55
55/601
120/11
11/120

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Three numbers are in the ratio 1:2:3 and their H.C.F is 12. The numbers are:

4, 8, 12
10, 20, 30
10, 20, 30
5, 10, 15

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
There are four prime numbers written in ascending order of magnitude. The product of the first three is 385 and of the last three is 1001. Find the fourth number?

5
7
11
13

ANSWER DOWNLOAD EXAMIANS APP

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

6720
8720
9720
7720

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The Largest number of four digits is 9999.       Required number must be divisible by L.C.M. of 12,15,18,27 i.e. 540.      On dividing 9999 by 540,we get 279 as remainder .   Required number = (9999-279) = 9720.

Problems on H.C.F and L.C.M
Find the least multiple of 13 which when divided by 6, 8 and 12 leaves 5, 7 and 11 as remainders respectively?

221
260
169
143

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
↑