How can modular arithmetic explain how a number a is divisible by b if the sum of a's digits is divisible by b.
It can't, it isn't true.
Take the number 32 for example, and your spoiled for choice, the sum of it's digits is 5 which is divisible by 5, but 32 is not divisible by 5.
