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”.
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.
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?
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”.
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.