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

3
5
4
6

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:

1015
689
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
Two numbers are in the ratio of 15:11. If their H.C.F. is 13, find the numbers.

195, 143
295, 243
95, 43
395, 343

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Let the required numbers be 15.x and 11x.Then, their H.C.F. is x. So, x = 13.The numbers are (15 x 13 and 11 x 13) i.e., 195 and 143.

Problems on H.C.F and L.C.M
The largest four-digit number which when divided by 4, 7 or 13 leaves a remainder of 3 in each case,is :

9834
9831
8739
9893

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The smallest number when increased by " 1 " is exactly divisible by 12, 18, 24, 32 and 40 is:

1440
1439
1449
1459

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the least number which when divided by 35 leaves remainder 25, when divided by 25 leaves remainder 15 and when divided by 15 leaves remainder 5?

435
420
515
518

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
↑