• 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 greatest number of four digits which is divisible by 15, 24, 40 and 75 is :

9600
9400
9000
9800

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

245
125
485
845

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number which when diminished by 7, is divisible 12, 16, 18, 21 and 28 is:

689
1015
268
432

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Required number = (L.C.M. of 12,16, 18, 21, 28) + 7= 1008 + 7= 1015

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.

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

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
How many minimum number's of whole square slabs are required for paving the floor 12.96 meters long and 3.84 meters side?

192
108
256
216

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:

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

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
↑