• 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
504
7056
3600

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F and L.C.M of two numbers are 11 and 385 respectively. If one number lies between 75 and 125 , then that number is

88
99
110
77

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A gardener was asked a plant flowers in a row containing equal number of plants. He tried to plant 6, 8, 10 and 12 in each row, but 5 plants left in each case. When he planted 13 in a row, no plant wa

125
245
485
845

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

88
55
66
77

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
The least number which is a perfect square and is divisible by each of the numbers 16, 20 and 24, is:

14400
6400
3600
1600

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

10720
9720
11720
8720

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

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
↑