00:01
So we're asked to prove that if the sum of the alternating digits in a number n or divisible by 11, the number n itself is divisible by 11.
00:14
So one thing to know is that addition and multiplication in mod and all defined.
00:20
So i've shown that here.
00:24
And also that if you're given a number in base b, then that number is equal to this formula here.
00:32
So let's start to prove.
00:34
So let n be in positive integer of k digits, a subk through a sub 0.
00:43
This means that i can rewrite the number n since it's in base 10 using this formula up here.
00:51
I can say that n equals this right here.
00:56
I just substituted b for 10.
00:58
And we want to show that 11 divides n, if and only if 11 divides a sub 0 minus a sub 1...