• 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 smallest number which when diminished by 7, is divisible 12, 16, 18, 21 and 28 is:

689
432
268
1015

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

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

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A, B and C start at the same time in the direction to run around a circular stadium. A completes a round in 252 seconds and C in 198 seconds, all starting at the same point. after what time will they

46 minutes 12 econds
45 minutes
42 minutes 36 econds
26 minutes 18 econds

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number of five digits which is exactly divisible by 12,15 and 18 is :

10010
10080
10015
10020

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 NA

Problems on H.C.F and L.C.M
The least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

15210
11115
15110
15120

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number that, while dividing 47, 215 and 365, gives the same remainder in each case?

5
3
4
6

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
↑