Take three consecutive integers, with the largest a multiple of 3. Form their sum. Compute the sum of its digits, do the same for the result until a one-digit number is obtained. Iamblichus of Chalis claimed that the one-digit number obtained will always equal 6. For example, the sum of 9997, 9998 and 9999 is 29 994. The sum of the digits of 29 994 is 33 and the sum of the digits of 33 is 6. Prove Iamblichus's claim.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Claim: Finding the digit sum of a number, x, is equivilant to x(mod9).
Proof: Let x have five digits (for simplicity), a,b,c,d, and e.
x can be written as 10000a+1000b+100c+10d+e
This is the same as (9999a+999b+99c+9d)+(a+b+c+d+e)
Therefore, x(mod9)≡a+b+c+d+e(mod9) Since the rest of the expression above is divisible by 9.
This can be done continually, until a number less than 9 has been attained.
Now back to the original problem.
The three numbers can be written as 3n+1,3n+2 and 3n+3
Adding them up results to 9n+6
The digit sum of that is 9n+6(mod9)≡6 because 9n is divisble by 9
Therefore the digit sum of 3 consecutive integers, when the largest number is a multiple of 3 is always 6
Log in to reply
Ok.Then what?
Log in to reply
Sorry, i had to eat dinner.