• 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 11 and their L.C.M. is 693 . If one of the numbers is 77, find the other .

88
77
95
99

ANSWER DOWNLOAD EXAMIANS APP

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 :

4
6
3
5

ANSWER DOWNLOAD EXAMIANS APP

Problems on H.C.F and L.C.M
H.C.F of 4 * 27 * 3125, 8 * 9 * 25 * 7 and 16 * 81 * 5 * 11 * 49 is:

360
1260
540
180

ANSWER DOWNLOAD EXAMIANS APP

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

2683
3683
4683
1683

ANSWER EXPLANATION DOWNLOAD EXAMIANS APP

L.C.M. of 5,6,7,8 = 840.    Required number is of the form 840k + 3     Least value of k for which (840k + 3) is divisible by 9 is k = 2. Required number = (840 X 2 + 3)=1683

Problems on H.C.F and L.C.M
The least number which is a perfect square and is divisible by each of the numbers 16,20, and 24, is :

1600
6400
11400
3600

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?

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

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
↑