7
Subtract 2 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 7, the original number is also divisible by 7
Check for 945: : 94-(2*5)=84. Since 84 is divisible by 7, the original no. 945 is also divisible
13
Add 4 times the last digit to the remaining truncated number. Repeat the step as necessary. If the result is divisible by 13, the original number is also divisible by 13
Check for 3146:: 314+ (46) = 338:: 33+(48) = 65. Since 65 is divisible by 13, the original no. 3146 is also divisible
17
Subtract 5 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 17, the original number is also divisible by 17
Check for 2278:: 227-(5*8)=187. Since 187 is divisible by 17, the original number 2278 is also divisible.
19
Add 2 times the last digit to the remaining truncated number. Repeat the step as necessary. If the result is divisible by 19, the original number is also divisible by 19
Check for 11343:: 1134+(23)= 1140. (Ignore the 0):: 11+(24) = 19. Since 19 is divisible by 19, original no. 11343 is also divisible
23
Add 7 times the last digit to the remaining truncated number. Repeat the step as necessary. If the result is divisible by 23, the original number is also divisible by 23
Check for 53935:: 5393+(75) = 5428 :: 542+(78)= 598:: 59+ (7*8)=115, which is 5 times 23. Hence 53935 is divisible by 23
29
Add 3 times the last digit to the remaining truncated number. Repeat the step as necessary. If the result is divisible by 29, the original number is also divisible by 29
Check for 12528:: 1252+(38)= 1276 :: 127+(36)= 145:: 14+ (3*5)=29, which is divisible by 29. So 12528 is divisible by 29
31
Subtract 3 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 31, the original number is also divisible by 31
Check for 49507:: 4950-(37)=4929 :: 492-(39) :: 465:: 46-(3*5)=31. Hence 49507 is divisible by 31
37
Subtract 11 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 37, the original number is also divisible by 37
Check for 11026:: 1102 – (116) =1036. Since 103 – (116) =37 is divisible by 37. Hence 11026 is divisible by 37
41
Subtract 4 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 41, the original number is also divisible by 41
Check for 14145:: 1414 – (45) =1394. Since 139 – (44) =123 is divisible by 41. Hence 14145 is divisible by 41
43
Add 13 times the last digit to the remaining truncated number. Repeat the step as necessary. If the result is divisible by 43, the original number is also divisible by 43.*This process becomes difficult for most of the people because of multiplication with 13.
Check for 11739:: 1173+(13*9)= 1290:: 129 is divisible by 43. 0 is ignored. So 11739 is divisible by 43
47
Subtract 14 times the last digit from remaining truncated number. Repeat the step as necessary. If the result is divisible by 47, the original number is also divisible by 47. This too is difficult to operate for people who are not comfortable with table of 14.
Check for 45026:: 4502 – (146) =4418. Since 441 – (148) =329, which is 7 times 47. Hence 45026 is divisible by 47
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
To prove this... Oh no.
Log in to reply
What do you mean? I did this all in my head. E.g. 47∣10a+b⟺47∣140a+14b⟺47∣14b−a
This exact algorithm works for every one of the provided rules. Just multiply 10a+b by the number mentioned in the rule (in the case I've shown it's 14; let's call it t) and subtract da until ∣k∣ is the smallest, where d∣ka+tb (here d is the divisor for which the rule is proved).
Log in to reply
I meant to prove that this works might require some time and might require 23 cases of spamming... Doesn't seem like the best thing to prove.
Wow! This is useful!
There are several typos. As I get time I will mention them with corrections.
Thank you. Its very useful for Maths students.
it's really helpful.
Please Provide proof For 47
Divisibility rule of 11
Divisibility rule of 3
Log in to reply
You have to just add the digits if the sum is divisible by 3 than its divisible eg. 2034= 2+0+3+4= 9 which is divisible by 3 so 2034 is divisible by 3