this post was submitted on 17 Jul 2024
256 points (93.2% liked)
Showerthoughts
30532 readers
968 users here now
A "Showerthought" is a simple term used to describe the thoughts that pop into your head while you're doing everyday things like taking a shower, driving, or just daydreaming. The most popular seem to be lighthearted, clever little truths, hidden in daily life.
Here are some examples to inspire your own showerthoughts: 1
Rules
- All posts must be showerthoughts
- The entire showerthought must be in the title
- No politics
- If your topic is in a grey area, please phrase it to emphasize the fascinating aspects, not the dramatic aspects. You can do this by avoiding overly politicized terms such as "capitalism" and "communism". If you must make comparisons, you can say something is different without saying something is better/worse.
- A good place for politics is c/politicaldiscussion
- If you feel strongly that you want politics back, please volunteer as a mod.
- Posts must be original/unique
- Adhere to Lemmy's Code of Conduct
If you made it this far, showerthoughts is accepting new mods. This community is generally tame so its not a lot of work, but having a few more mods would help reports get addressed a little sooner.
Whats it like to be a mod? Reports just show up as messages in your Lemmy inbox, and if a different mod has already addressed the report the message goes away and you never worry about it.
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
How the hell is 717 not a prime number? Who fucked that up? I vote we just change that
Divisible by 3. Easy to check since 7 + 1 + 7 = 15 which is divisible by 3.
Oh awesome that's a neat trick I've never seen before. How does that work? For a number like 700 for example, 7 + 0 + 0 = 7 but 700 is visible by 10.
You can only use this method to check if the number can be divided by 3.
It works for 9, too.
If you're looking for a proof:
Our base 10 system represents numbers by having little multipliers in front of each power of 10. So a number like 1234 is 1 x 10^3 + 2 x 10^2 + 3 x 10^1 + 4 x 10^0 .
Note that 10 is just (3 x 3) + 1. So for any 2 digit number, you're looking at the first digit times (9 + 1), plus the second digit. Or:
(9 times the first digit) + (the first digit) + (the second digit).
Well we know that 9 times the first digit is definitely divisible by both 3 and 9. And we know that adding two divisible-by-n numbers is also divisible by n.
So we can ignore that first term (9 x first digit), and just look to whether first digit plus second digit is divisible. If it is, then you know that the original big number is divisible.
And when you extend this concept out to 3, 4, or more digit numbers, you see that it holds for every power of 10, and thus, every possible length of number. For both 9 and 3.