• 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
Six bells commence tolling together and toll at intervals of 2,4,6,8,10 and 12 seconds respectively. in 30 m9nutes,how many times do they toll together ?

10
15
4
16

ANSWER DOWNLOAD EXAMIANS APP

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

427
869
859
4320

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 :

10015
10010
10080
10020

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

 NA

Problems on H.C.F and L.C.M
Find the least number which when divided by 5,6,7, and 8 leaves a remainder 3, but when divided by 9 leaves no remainder .

2683
4683
1683
3683

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5,6,7,8 = 840.    Required number is of the form 840k + 3     Least value of k for which (840k + 3) is divisible by 9 is k = 2. Required number = (840 X 2 + 3)=1683

Problems on H.C.F and L.C.M
Find the least multiple of 23, which when divided by 18, 21 and 24 leaves remainders 7, 10 and 13 respestively.

3024
3013
3036
3002

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Let the leas number of six digits. which when divided by 4, 6, 10 and 15 leaves in each case the same remainder of 2 be N. The sum of the digits in N is

6
3
5
4

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
↑