• 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 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

99
88
77
110

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The HCF of two numbers is 42 and the other two factors of their LCM are 11 and 12. What is the largest number.

450
462
504
480

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
H.C.F of 4 x 27 x 3125, 8 x 9 x 25 x 7 and 16 x 81 x 5 x 11 x 49 is

540
360
180
1260

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A rectangular courtyard 3.78 meters long 5.25 meters wide is to be paved exactly with square tiles, all of the same size. what is the largest size of the tile which could be used for the purpose?

42 cms
14 cms
None of these
21 cms

ANSWER DOWNLOAD EXAMIANS APP

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

11340
12765
9720
10478

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The largest 4 digit number is 9999.We know that , if LCM of given numbers divide a number N , then N is exactly divisible by all the given numbers .LCM of 12,15,18,27 is 540.On dividing 9999 by 540 we get 279 as remainder.Therefore number =9999 - 279 =9720.

Problems on H.C.F and L.C.M
Find the H.C.F of 12, 16, 18 and 24?

4
2
3
1

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
↑