Home
Class 14
MATHS
A number 'x' is completely divisible by ...

A number 'x' is completely divisible by 9 but leaves remainder 3 when divided by 6, 5, 7 and 8. Find the sum of digits of 'x' ?

A

21

B

22

C

18

D

24

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem step by step, we need to find a number \( x \) that meets the following conditions: 1. \( x \) is completely divisible by 9. 2. \( x \) leaves a remainder of 3 when divided by 6, 5, 7, and 8. ### Step 1: Understand the conditions Since \( x \) leaves a remainder of 3 when divided by 6, 5, 7, and 8, we can express \( x \) in the form: \[ x = 840k + 3 \] where \( 840 \) is the least common multiple (LCM) of 6, 5, 7, and 8. ### Step 2: Calculate the LCM To find the LCM of 6, 5, 7, and 8: - The prime factorization of each number is: - \( 6 = 2 \times 3 \) - \( 5 = 5 \) - \( 7 = 7 \) - \( 8 = 2^3 \) The LCM is found by taking the highest power of each prime: - \( 2^3 \) from 8 - \( 3^1 \) from 6 - \( 5^1 \) from 5 - \( 7^1 \) from 7 Thus, the LCM is: \[ LCM = 2^3 \times 3^1 \times 5^1 \times 7^1 = 8 \times 3 \times 5 \times 7 = 840 \] ### Step 3: Set up the equation for \( x \) Now we can express \( x \) as: \[ x = 840k + 3 \] ### Step 4: Ensure \( x \) is divisible by 9 Next, we need \( x \) to be divisible by 9. Therefore, we can set up the equation: \[ 840k + 3 \equiv 0 \, (\text{mod} \, 9) \] Calculating \( 840 \mod 9 \): - \( 840 \div 9 = 93 \) remainder \( 3 \) - Thus, \( 840 \equiv 3 \, (\text{mod} \, 9) \) Substituting this back into our equation: \[ 3k + 3 \equiv 0 \, (\text{mod} \, 9) \] This simplifies to: \[ 3(k + 1) \equiv 0 \, (\text{mod} \, 9) \] ### Step 5: Solve for \( k \) This means \( k + 1 \) must be divisible by 3: \[ k + 1 \equiv 0 \, (\text{mod} \, 3) \] Thus, \( k \equiv 2 \, (\text{mod} \, 3) \). The possible values for \( k \) can be \( 2, 5, 8, \ldots \) ### Step 6: Try values for \( k \) Let’s start with \( k = 2 \): \[ x = 840 \times 2 + 3 = 1680 + 3 = 1683 \] ### Step 7: Check divisibility by 9 Now, we need to check if \( 1683 \) is divisible by 9: - Sum of the digits of \( 1683 = 1 + 6 + 8 + 3 = 18 \) - Since \( 18 \) is divisible by 9, \( 1683 \) is also divisible by 9. ### Step 8: Find the sum of the digits of \( x \) The sum of the digits of \( x = 1683 \) is: \[ 1 + 6 + 8 + 3 = 18 \] ### Final Answer Thus, the sum of the digits of \( x \) is \( 18 \). ---
Promotional Banner

Topper's Solved these Questions

  • GEOMETRY

    MOTHERS|Exercise MULTIPLE CHOICE QUESTIONS |413 Videos
  • NUMBER SYSTEM

    MOTHERS|Exercise O|400 Videos

Similar Questions

Explore conceptually related problems

Find the sum of all 3 digit numbers which leave remainder 3 when divided by 5 .

is the least number leaves remainder 1when divided by 2,3,4,5,6,7,8,9,10

The sum of all two digit numbers each of which leaves remainder 3 when divided by 5 is :

Let x be the least number, which when divided by 5, 6, 7 and 8 leaves a remainder 3 in each case but when divided by 9 leaves remainder 0. The sum of digits of x is:

The least number which when divided by 5 6 7 and 8 leaves a remainder 3 is

Sum of all two digit numbers divisible by 7 leaves remainder 2 or 5 is

MOTHERS-LCM & HCF-MULTIPLE CHOICE QUESTION
  1. Let N is the least number of 6 digits, which when divide by 4, 6, 10 a...

    Text Solution

    |

  2. The least number of 5-digits which is divisible by 45, 60, 75 and 120 ...

    Text Solution

    |

  3. A number 'x' is completely divisible by 9 but leaves remainder 3 when ...

    Text Solution

    |

  4. Find out the least number, which, when divided by 15, 24, 32 and 45 le...

    Text Solution

    |

  5. Find the largest 3 digit number given remainder 1 and 5, when divided ...

    Text Solution

    |

  6. Find the smallest number which us divided by 8 & 5 and leaves remainde...

    Text Solution

    |

  7. LCM of 15^(10),20^(12) and N is 60^(12) , then find the possible value...

    Text Solution

    |

  8. LCM of 12^(24),16^(18) and N is 24^(24) , then find the possible value...

    Text Solution

    |

  9. LCM of N(1) and N(2) is 100, then find the possible pairs of N(1) & N(...

    Text Solution

    |

  10. LCM of N(1) and N(2) is 200, then find the possible pairs of N(1) & N(...

    Text Solution

    |

  11. LCM of N(1) and N(2) is 300, then find the possible pairs of N(1) & N(...

    Text Solution

    |

  12. The highest four-digit number which is divisible by each of the number...

    Text Solution

    |

  13. Find the largest number of four digit which is divisible by 10, 15 and...

    Text Solution

    |

  14. Find the largest four digit number which is divisible by 12, 15, 18 an...

    Text Solution

    |

  15. Which is the smallest number, which on dividing by 18, 24, 30 and 42 l...

    Text Solution

    |

  16. Find the smallest number which when divided by 2, 3, 4, 5 & 6 leaves r...

    Text Solution

    |

  17. Find the largest three digit number which leave remainder as one being...

    Text Solution

    |

  18. Find the smallest digit which gives remainder as 3 on being divided by...

    Text Solution

    |

  19. Find the smallest digit which on divided by 5, 7, 11 & 13 gives remain...

    Text Solution

    |

  20. Find the four digit number which is completely divisible by 12, 15, 18...

    Text Solution

    |