• 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
Reduce 391/667 to lowest terms .

17/29
11/13
31/45
23/37

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

H.C.F. of 391 and 667 is 23.On dividing the numerator and denominator by 23, we get :391 = 391 ¸23 = 17667    667¸ 23    29

Problems on H.C.F and L.C.M
Find the lowest 4-digit number which when divided by 3, 4 or 5 leaves a remainder of 2 in each case?

1026
1020
1030
1022

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?

60
50
45
44

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 ?

11340
12765
10478
9720

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 least multiple of 13 which when divided by 6, 8 and 12 leaves 5, 7 and 11 as remainders respectively?

169
143
221
260

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The Smallest number which when diminished by 7, is divisible by 12,16,18,21 and 28 is :

1022
1032
1015
1008

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
↑