this post was submitted on 08 Jan 2025
555 points (95.3% liked)
memes
16739 readers
2820 users here now
Community rules
1. Be civil
No trolling, bigotry or other insulting / annoying behaviour
2. No politics
This is non-politics community. For political memes please go to !politicalmemes@lemmy.world
3. No recent reposts
Check for reposts when posting a meme, you can only repost after 1 month
4. No bots
No bots without the express approval of the mods or the admins
5. No Spam/Ads/AI Slop
No advertisements or spam. This is an instance rule and the only way to live. We also consider AI slop to be spam in this community and is subject to removal.
A collection of some classic Lemmy memes for your enjoyment
Sister communities
- !tenforward@lemmy.world : Star Trek memes, chat and shitposts
- !lemmyshitpost@lemmy.world : Lemmy Shitposts, anything and everything goes.
- !linuxmemes@lemmy.world : Linux themed memes
- !comicstrips@lemmy.world : for those who love comic stories.
founded 2 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Now provide the proof
https://brilliant.org/wiki/proof-of-divisibility-rules/
The 7 and 13 rules are pretty cool too.
This is insane stuff. 13 is truly mesmerizing. Although I don't think I'm sharp enough for the proofs. Even the divisibility by 2 proof looks hellish.
I have discovered a truly marvelous demonstration of this proposition that this comment section is too narrow to contain.
Il do it for disability by three and a three digit numbers with the digits a, b and c. The value of that number then is 100a + 10b + c. They concept is the same for nine.
This means that, mod 3, a three digit number is equivalent to the sum of it's digits and therefore preserves disability by 3.