Question

the sum of digit of dividend is the same as a reminder when you divide by​

Answer 1

Answer:

Let s(n) denote the sum of the digits of n. Then find the maximum remainder when n is divided by s(n) if n is a two digit number.

Step-by-step explanation:

For two-digit numbers, the largest digit sum is 18, which only occurs for n=99, but 99mod18=9. This rules out 17 as a possible answer for the largest remainder.

The digit sum 17 occurs only for n=98 and n=89. But 98mod17=13 and 89mod17=4, which rules out 16 as a possible answer.

The digit sum 16 occurs for 97, 88, and 79. Testing these, we find

97mod1688mod1679mod16=1=8=15

and there we have it: 15 is the largest possible remainder (and occurs at n=79).

Given the erratic nature of the sequence of remainders, I don't see any easy alternative to this kind of case by case approach if, for example, you ask the same question for three-digit numbers.

mark brainliest if helps