this post was submitted on 04 Nov 2024
681 points (97.8% liked)

Science Memes

11068 readers
2784 users here now

Welcome to c/science_memes @ Mander.xyz!

A place for majestic STEMLORD peacocking, as well as memes about the realities of working in a lab.



Rules

  1. Don't throw mud. Behave like an intellectual and remember the human.
  2. Keep it rooted (on topic).
  3. No spam.
  4. Infographics welcome, get schooled.

This is a science community. We use the Dawkins definition of meme.



Research Committee

Other Mander Communities

Science and Research

Biology and Life Sciences

Physical Sciences

Humanities and Social Sciences

Practical and Applied Sciences

Memes

Miscellaneous

founded 2 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] TwilightKiddy@programming.dev 87 points 1 week ago (11 children)

The divisability rule for 7 is that the difference of doubled last digit of a number and the remaining part of that number is divisible by 7.

E.g. 299'999 → 29'999 - 18 = 29'981 → 2'998 - 2 = 2'996 → 299 - 12 = 287 → 28 - 14 = 14 → 14 mod 7 = 0.

It's a very nasty divisibility rule. The one for 13 works in the same way, but instead of multiplying by 2, you multiply by 4. There are actually a couple of well-known rules for that, but these are the easiest to remember IMO.

[–] darkpanda@lemmy.ca 13 points 1 week ago (7 children)

If all of the digits summed recursively reduce to a 9, then the number is divisible by 9 and also by 3.

If the difference between the sums of alternating sets digits in a number is divisible by 11, then the number itself is divisible by 11.

That’s all I can remember, but yay for math right?

[–] TwilightKiddy@programming.dev 8 points 1 week ago (5 children)

Well, on the side of easy ones there is "if the last digit is divisible by 2, whole number is divisible by 2". Also works for 5. And if you take last 2 digits, it works for 4. And the legendary "if it ends with 0, it's divisible by 10".

[–] darkpanda@lemmy.ca 9 points 1 week ago* (last edited 1 week ago) (1 children)

There’s also the classic “no three positive integers a, b, and c to satisfy a**n + b**n = c**n for values of n greater than 2“ trick but my proof is too large to fit in this comment.

load more comments (3 replies)
load more comments (4 replies)
load more comments (7 replies)