2: It turns out that an integer (written as usual in base-10) is divisible by 3 if and only if its sum of digits is divi
Posted: Thu Jul 14, 2022 3:57 pm
2: It turns out that an integer (written as usual in base-10) is divisible by 3 if and only if its sum of digits is divisible by 3 . (Also, you can use this recursively: For instance, 59388 is divisible by 3 because 5+9+3+8+8=33 and 3+3=6.) Please prove that this trick works. Hint: Note that 10=1mod3 and observe that any integer written in base-10 is simply a sum of powers of 10 . The proof is then short, and just a matter of setting notation correctly.