IIRC it doesn’t; that has caused me pain so many times when trying to generate fractional range
is beehaw related to lemmy?
IIRC it doesn’t; that has caused me pain so many times when trying to generate fractional range
That won’t work tho, you need to make it sys.maxsize//2 to coerce the output into int form
That may be exactly what I need when searching for some highly technical problem lol
Huh I didn’t notice that. That does sound a bit weird :/
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
For Meet, I’d also suggest Jitsi. For Drive, I’d recommend giving cryptpad.fr a shot; that seems to be the closest to Drive’s file editing capabilities.
I see your encourageMint and raise you
Commenting so you see your post one more time
Not exactly what you wanted, but njalla is a privacy-focussed domain registrar that basically buys domains on your behalf under their own name and gives you all the access to it that you need
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.