• 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 H.C.F of two numbers is 8. Which of the following can never be their L.C.M?

60
24
56
48

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
In finding the HCF of two numbers, the last divisor was 41 and the successive quotients, starting from the first, where 2, 4 and 2. The numbers are?

800,500
820,369
820,360
700,400

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
An officer was appointed on maximum daily wages on contract money of Rs. 4956. But on being absent for some days, he was paid only Rs. 3894. For how many days was he absent?

3
6
5
4

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 lowest 4-digit number which when divided by 3, 4 or 5 leaves a remainder of 2 in each case?

1020
1022
1030
1026

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Find the H.C.F of 12, 16, 18 and 24?

1
3
4
2

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
↑