The greatest number which may replace * in the number 1190*6 make the number divisible by 9 is
1
The fundamental rule to check if a number is divisible by 9 is to sum all its digits. If the sum of the digits is a multiple of 9 (like 9, 18, 27, etc.), then the original number is divisible by 9.
We are given the number 1190*6 and need to find the largest digit that can replace the asterisk (*) to make the number divisible by 9.
Let's represent the unknown digit in the asterisk's position as $d$. The number can be written as $1190d6$.
To apply the divisibility rule, we calculate the sum of all the digits in $1190d6$.
The digits of the number are 1, 1, 9, 0, $d$, and 6.
The sum of the digits is calculated as follows:
Sum $= 1 + 1 + 9 + 0 + d + 6$
Summing the known digits:
$1 + 1 + 9 + 0 + 6 = 17$.
So, the total sum of the digits is $17 + d$.
For the number $1190d6$ to be divisible by 9, the sum of its digits, $17 + d$, must be a multiple of 9.
The digit $d$ must be an integer between 0 and 9, inclusive (i.e., $0 \le d \le 9$).
We look for multiples of 9 that can be formed by adding $d$ to 17:
The only single digit value for $d$ that satisfies the condition ($17+d$ being a multiple of 9) is $d=1$. Therefore, 1 is the greatest digit that can replace the asterisk.
If we substitute $d=1$ back into the number, we get 119016. The sum of its digits is $1 + 1 + 9 + 0 + 1 + 6 = 18$. Since 18 is divisible by 9, the number 119016 is confirmed to be divisible by 9.
The calculation shows that the digit 1 is the required digit. Let's check this against the given options:
The digit 1, which we found to be the correct replacement for the asterisk, matches Option 2.
What is the quotient when 1359 is divided by 48?
What is the value of x so that the seven digit number 5656x52 is divisible by 72?
What is the value of x so that the seven digit number 55350x2 is divisible by 72?
The greatest number that divides 126, 224 and 608 leaving remainders 2, 7 and 19, respectively, is:
What least number must be subtracted from 210, so that the sum is completely divisible by 11?
A number when divided by the sum of 555 and 445 gives two times their difference as quotient and 30 as the remainder. The number is:
In a division sum, the divisor ‘d’ is 10 times the quotient ‘q’ and 5 times the remainder ‘r’. If r = 46, the dividend will be:
If the 8-digit number 2074x4y2 is divisible by 88, then the value of (4x + 3y) is:
If 7 divided a positive integer n, the remainder is 2. Which of the following numbers gives a remainder of 0 when divided by 7?
If the nine-digit number 708x6y8z9 is divisible by 99 then what is the value of x + y + z?
What smallest number should be added to 16809 so that the sum is completely divisible by 41?