• 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
Find the greatest number which on dividing 1661 and 2045, leaves a reminder of 10 and 13 respectively

129
133
127
131

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

In this type of question, its obvious we need to calculate the HCF, trick isHCF of (1661 - 10) and (2045 -13)= HCF (1651, 2032) = 127

Problems on H.C.F and L.C.M
Let the least 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
6
4

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number of four digits which is divisible by 15, 25, 40 and 75 is:

9000
9800
9600
9400

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The least number which when divided by 5,6,7 And 8 leaves a remainder 3, but when divided by 9 leaves no remainder, is :

1677
1683
2523
3363

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
Two numbers 4242 and 2903 when divided by a certain number of three digits, leave the same remainder. Find the number?

101
107
113
103

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
The H.C.F. of two numbers is 23 and the other two factors of their L.C.M. are 13 and 14. The larger of the two numbers is:

345
322
276
299

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

Clearly, the numbers are (23 x 13) and (23 x 14). Larger number = (23 x 14) = 322.

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
↑