• 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
Find the largest number which divides 62,132,237 to leave the same reminder

35
30
25
None of these

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Trick is HCF of (237-132), (132-62), (237-62)= HCF of (70,105,175) = 35

Problems on H.C.F and L.C.M
The least number which when increased by 5 is divisible by each one of 24, 32, 36 and 54, is

859
4320
427
869

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
485
125
845

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the HCF of 2/3, 4/9 and 6/5

8/45
4/15
2/45
7/45

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The wheels revolve round a common horizontal axis. They make 15, 20 and 48 revolutions in a minute respectively. Starting with a certain point on the circumference down wards. After what interval of t

2 min
None
1 min
3 min

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A room is 4 meters 37 cm long and 3 meters 23cm broad. It is required to pave the floor with minimum square slabs. Find the number of slabs required for this purpose?

431
391
485
381

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
↑