Yup it seems crazy to me how deep insights one needs to have to be able to, say, connect the dots between compression and machine learning. And now it looks to me like he has done a lot of the foundational work in these fields. Super cool stuff

Too lazy to check, but is this the Rivest from the RSA algorithm?

Last I checked (which was some time ago), pandoc-bin doesn’t require the haskell dependencies. I saved quite some installation time (and screen space during installation) by switching.

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

I see your encourageMint and raise you

2. Strairdrac is three crabs in a trenchcoat, now teaching others of his kind how to blend in with humans