is beehaw related to lemmy?

  • 0 Posts
  • 1 Comment
Joined 1 year ago
cake
Cake day: June 8th, 2023

help-circle
  • Indeed, an integer is divisible by 3 if and only if the sum of its digits is divisible by 3.

    For proof, take the polynomial representation of an integer n = a_0 * 10^k + a_1 * 10^{k-1} + … + a_k * 1. Note that 10 mod 3 = 1, which means that 10^i mod 3 = (10 mod 3)^i = 1. This makes all powers of 10 = 1 and you’re left with n = a_0 + a_1 + … + a_k. Thus, n is divisible by 3 iff a_0 + a_1 + … + a_k is. Also note that iff answers your question then; all multiples of 3 have to, by definition, have digits whose sum is a multiple of 3