• 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
There are four prime numbers written in ascending order of magnitude. The product of the first three is 385 and of the last three is 1001. Find the fourth number?

7
13
5
11

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find largest number of 4 digits divisible by 12, 15, 18, 27 ?

12765
9720
11340
10478

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

The largest 4 digit number is 9999.We know that , if LCM of given numbers divide a number N , then N is exactly divisible by all the given numbers .LCM of 12,15,18,27 is 540.On dividing 9999 by 540 we get 279 as remainder.Therefore number =9999 - 279 =9720.

Problems on H.C.F and L.C.M
Find the greatest number which is such that when 697, 909 and 1227 are divided by it, the remainders are all the same?

106
53
112
108

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The maximum number of student amoung them 1001 pens and 910 pencils can be distributed in such a way that each student gets the same number of pens and same number of pencils is :

910
1001
91
1911

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
LCM of 1/3, 5/6, 5/4, 10/7 is:

10/11
10
11/10
10/7

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
What is the smallest number which when diminished by 8, is divisible by 9, 6, 12 and 18?

45
60
44
50

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
↑