- #1
Ed Quanta
- 297
- 0
That iff the sum of the digits of n is divisible by 3, then n is divisible by 3.
Defining t(n) to be the sum of the digits of n, can I just use induction show n-t(n)=3x is true. Since we know if this statement is true, then it can't be true for n+1, do I use n+3 as what I am trying to show holds true by induction?
Defining t(n) to be the sum of the digits of n, can I just use induction show n-t(n)=3x is true. Since we know if this statement is true, then it can't be true for n+1, do I use n+3 as what I am trying to show holds true by induction?