What is the least number that must be subtracted from 1160 so that the sum of 1160and resulting number is completely divisible by 19?

Open in App

Solution

Let the least number be n which need to be subtracted.

1160+1160-n this should be divisible by 19.

The remainder obtained on dividing 2320 by 19 is 2.

On subtracting 2320–2 you would get a number divisible by 19.

Therefore n is 2.

Suggest Corrections

Similar questions

What is the largest number that must be substracted from 1160 so that the sum of 1160 and the resulting number is completely divisible by 19.

Q. Find the least number which must be subtracted from 9269 so that resulting number is exactly divisible by 73.

Q. What is the least number that must be subtracted from 1056 so the number is divisible by 23?

Find the number that must be subtracted from the polynomial $3^{3} + y^{2} - 22 y + 15,$ so, that the resulting polynomial is completely divisible by y + 3.

Q. What least number must be subtracted from

13601

, so that the remainder is divisible by

87

Join BYJU'S Learning Program

What is the least number that must be subtracted from 1160 so that the sum of 1160and resulting number is completely divisible by 19?

Let the least number be n which need to be subtracted. 1160+1160-n this should be divisible by 19. The remainder obtained on dividing 2320 by 19 is 2. On subtracting 2320–2 you would get a number divisible by 19. Therefore n is 2.

Let the least number be n which need to be subtracted.

1160+1160-n this should be divisible by 19.

The remainder obtained on dividing 2320 by 19 is 2.

On subtracting 2320–2 you would get a number divisible by 19.

Therefore n is 2.