Given that , then , since .
OK here is the problem posed to me and this instructor does like to throw things in that are not always true so that may be the case but i tried a few cases and it seems to work. The question is: For any natural number n, n is congruent to the alternating sum of its digits mod 11. I have no idea where to even start with this. Any help would be greatly appreciated.