• 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 least number, which when divided by 48, 60, 72, 108 and 140 leaves 38, 50, 62, 98 and 130 as remainders respectively, is:

15110
15120
11115
15210

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 11 and their L.C.M. is 693 . If one of the numbers is 77, find the other .

88
77
99
95

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Five bells ring together and ring at intervals of 2, 6, 8, 12 and 15 seconds respectively. How many times will they ring together in 60 minutes?

33
34
31
32

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the smallest number of five digits exactly divisible by 16,24,36 and 54.

10368
10568
10268
10468

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Smallest number of five digits is 10000.       Required number must be divisible by L.C.M. of 16,24,36,54 i.e 432,       On dividing 10000 by 432,we get 64 as remainder.    Required number = 10000 +( 432 – 64 ) = 10368.

Problems on H.C.F and L.C.M
LCM of 18 and 27 is:

89
91
85
54

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
A heap of stones can be made up into groups of 21. When made up into groups of 16, 20, 25 and 45 there are 3 stones left in each case. How many stones at least can there be in the heap?

2403
7203
3603
4803

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
↑