• 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 greatest number which will divide 25, 73 and 97 as so to leave the same remainder in each case?

24
32
18
12

ANSWER DOWNLOAD EXAMIANS APP

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
15110
15120
11115

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Four bells begin to toll together respectively at the intervals of 8, 10, 12 and 16 seconds. After how many seconds will they toll together again?

240 seconds
243 seconds
246 seconds
242 seconds

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the greatest number that exactly divides 35, 91 and 840?

7
5
8
6

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that sum is divisible by 5, 6, 4, 3?

23
25
21
27

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

LCM of 5,6,4,3 is 60.On dividing 2497 by 60 we get 37 as remainder.Therefore number to be added is 60 - 37 =23.

Problems on H.C.F and L.C.M
The least number which should be added to 2497 so that the sum is exactly divisible by 5, 6, 4 and 3 is:

21
23
22
24

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5, 6, 4 and 3 = 60. On dividing 2497 by 60, the remainder is 37.Number to be added = (60 - 37) = 23.

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
↑