- Joined
- Oct 8, 2001
- Location
- Redmond, WA
In the base-10 system, the digits of any multiple of 9 add up to 9 or a multiple of 9.
Example:
81: 8+1=9 | 81/9=9
27: 2+7=9 | 27/9=3
3258: 3+2+5+8=18, 1+8=9 | 3258/9=362
I'm pretty sure that it works in base-n (where n is an integer > 2) and n-1, but I want to see if there's a proof. To look for a proof, I need a name. Do either of these properties have one?
FWIW, I've taken a year of discrete math, so I know a little bit about proofs. I'm hoping that the proof for this doesn't go way over my head.
Example:
81: 8+1=9 | 81/9=9
27: 2+7=9 | 27/9=3
3258: 3+2+5+8=18, 1+8=9 | 3258/9=362
I'm pretty sure that it works in base-n (where n is an integer > 2) and n-1, but I want to see if there's a proof. To look for a proof, I need a name. Do either of these properties have one?
FWIW, I've taken a year of discrete math, so I know a little bit about proofs. I'm hoping that the proof for this doesn't go way over my head.