For a positive integer n, Let S(n) denote the sum of its decimal digits.
Then S(n)-n is always divisible by?
A)9
B)10
C)11
D)None of these is always true.
The only problem is i did not get what is meant by decimal digits of the integer?
If n is an integer then decimal digits must imply we are talking about numbers in the decimal system, I.e normal counting numbers as you know them.
Now pick any number n = 205 so S(n) = 2+0+5 = 9
Now S(n)-n = 205 - 9 = 196
196 is not divisble by 9, 10 or 11. Therefore we have found 1 example that contracdicts each of these sases therefore I think D is the answer.
let n be a positive integer.
then
So then
but consider the fact that
(mod 9)
induction if you want to be formal shows this means
(mod 9) for all
So if we consider
But reduce this mod 9
(mod 9)
But if two things are congruent to 0 mod 9, this means 9 divides this number.
So 9 divides S(n)-n
Definitely worth learning, however, there is in fact an alternative method that I think you can do with out modular arithmetic. Let's hope you at least know induction.
Lemma:
for all
k=1
This is clearly true.
(Induction Hypothesis) Suppose up to n,
Now we must show
But by induction hypothesis 9 divides the first term and clearly 9|9, so 9 divides the sum and the induction is complete.
Okay, so now pick up my old proof up at the point where I wrote out
Now instead of the modular argument, we will group nicely by coefficient.
So by our lemma but this means 9 divides every term so 9 must divide the whole thing which is S(n)-n as desired. QED (again)
Oh man, I didn't mean it to be a slight at all. I can see how that could have sounded pretty disrespectful, I just meant it more in the sense of I have no idea how to prove it without induction! It is always a difficult thing to judge what type of proof to present on here since I have no idea what kind of mathematical background any of the askers have. It is a struggle to find a common ground of risking using a fact or something the reader may be unfamiliar with and being able to present a concise elegant proof.
Well, if you find this problem interesting and are curious about doing another really fun problem like this you should consider the following. Also it would be a great practice for you if you decide to learn modular arithmetic (which you will have to if you continue in number theory, algebra, or discrete mathematics). Consider the test for divisibility by 11.
A number is divisible by 11 if and only if the alternating sum of its digits is divisible by 11.
Here is what I mean.
Is 72237 divisible by 11?
7 -3 +2 -2 +7 = 11 which is divisible by 11 clearly, so 72237 number is divisible by 11.
Opps!
Gamma,
I can recall a similar pattern that if the digits of an integer add to a multiple of 9 then it will be divisible by 9.
For example 2412, 2+4+1+2 = 9 and 2412/9 = 268
and 98172, 9+8+1+7+2 = 27 and 98172/9 = 10908
Apart from this one and the sum of alternating digits for divisibilty by 11, do you know any others?
The other ones are really unsatisfying that I know compared to these two, lol.
For 2, if it ends in 0,2,4,6,8 it is divisible by two... duh it is even
For 3, if you sum the digits and it is divisible by 3 the number is divisible by 3.
For 4, if you look at the last two digits if they are divisible by 4 then the whole thing is 4|100 is why.
For 5, again, look at whether the last digit is 5 or 0, then it is divisible by 5, otherwise it is not.
For 6, check divisibility by 2 and 3 if it is divisible by both then it is divisible by 6.
For 7 I am honestly not sure of a good test for this divisibility
For 8 you just gotta check the last 3 digits because 8|1000
For 9, yeah we got that one on lock down
For 10 if it ends in 0 yeah, otherwise not.
For 11 the one i mentioned is the only test i know.
Of course you can generalize the one for 6. If it is a product of distinct primes you can just check it for divisibility by each of the distinct primes that make up the number.