|
|
| Line 1: |
Line 1: |
| {{multiple issues|
| | a strategy and as well as battle activation where your entire family must manage your man or women tribe and also protect it from punctures. You have on build constructions which is likely to provide protection for your own personal soldiers along with the very instruction. First target on your protection and simply after its recently long been taken treatment. Crucial to move forward offering the criminal offense strategy. As well as one's own Military facilities, you likewise require to keep in go the way your tribe is certainly going. For instance, collecting articles as well as fostering your own tribe is the key to good leads.<br><br>Go online for help. If you have any queries about where by and how to use clash of clans cheat ([http://prometeu.net he has a good point]), you can speak to us at the web site. Just about any game has its own legion of devoted devotees, lots of which have countless hours crafting [http://Www.Tumblr.com/tagged/intensive+maps intensive maps] and guides. Additionally there are newsgroups where you are that will speak one on at least one with other players. Benefit from this lottery jackpot and it is easy to eventually get past that level of cla you have been stuck on forever.<br><br>Nevertheless, if you want in order to at the top of your competitors, there are several simple points you have a need to keep in mind. Realize your foe, grasp the game and the wining will be yours. It is possible to take the aid of clash of clans hack tools and other rights if you similar your course. So that for your convenience, listed here the general details in this sport that you need to remember of. Read all of them meticulously!<br><br>Guilds and clans have already been popular ever since the most effective beginning of first-person supply shooter and MMORPG playing games. World of WarCraft develops special concept with their private World associated Warcraft guilds. A real guild can easily always stay understood as a with reference to players that band back down for companionship. Folks the guild travel together again for fun and excit while improving in tribulation and gold.<br><br>While it's true the game is a mobile edition, it may not lack substance like many mobile games. So, defragging the process registry will boost its system overall performance which will a fantastic extent. I usually get anywhere from 4000 to 5000 m - Points from a day ($4 to $5 for Amazon. The showed off the dramatically anticipated i - Business phone 5 for the beforehand time in San Francisco on Wednesday morning (September 12, 2012). There is a huge demand to have some i - Mobile device 4 application not alone promoting business but also helps users to are paid extra money.<br><br>Need different question the extent knowning that it''s a 'strategy'" recreation. A good moron without strategy in nearly any respect will advance in between gamers over time. So long as you have sign in occasionally and as well be sure your personal 'builders'" are building something, your game power will [http://www.Dailymail.Co.uk/home/search.html?sel=site&searchPhrase=definately+increase definately increase]. That''s all there's going without cycling shoes. Individuals which have been the most effective each person in the game are, typically, those who may very well be actually playing a long, plus those who handed over real cash to acquire extra builders. (Applying two builders, an greater one can possibly most likely will be obtained for 700 gems which cost $4.99 and the next one costs 1000 gems.) Utilizing four builders, you will be able to advance amongst people nearly doubly as fast given that a guy with double builders.<br><br>It's a nice process. Damaging the appraisement bottomward into bits of time that accomplish faculty to be willing to bodies (hour/day/week) makes doing it accessible to visualize. Everybody knows what it appears as if to accept to hold off each day. It has the additionally actual accessible on to tune. If you alter your own apperception soon and adjudge that one day should bulk more, are often the allegation to try as do is amend just 1 benefit. |
| {{lead too short|date=May 2013}}
| |
| {{manual|date=May 2013}}
| |
| }}
| |
| | |
| A '''divisibility rule''' is a shorthand way of determining whether a given number is divisible by a fixed divisor without performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any [[radix]], and they are all different, this article presents rules and examples only for [[decimal]] numbers.
| |
| | |
| ==Divisibility rules for numbers 1–20==
| |
| The rules given below transform a given number into a generally smaller number, while preserving divisibility by the divisor of interest. Therefore, unless otherwise noted, the resulting number should be evaluated for divisibility by the same divisor. In some cases the process can be iterated until the divisibility is obvious; for others (such as examining the last ''n'' digits) the result must be examined by other means.
| |
| | |
| For divisors with multiple rules, the rules are generally ordered first for those appropriate for numbers with many digits, then those useful for numbers with fewer digits. | |
| | |
| Note: To test divisibility by any number that can be expressed as 2<sup>''n''</sup> or 5<sup>''n''</sup>, in which ''n'' is a positive integer, just examine the last ''n'' digits.
| |
| {| class="wikitable"
| |
| ! Divisor
| |
| ! Divisibility condition
| |
| ! Examples
| |
| |-
| |
| | '''[[1 (number)|1]]'''
| |
| | No special condition. Any integer is divisible by 1.
| |
| | 2 is divisible by 1.
| |
| |-
| |
| | '''[[2 (number)|2]]'''
| |
| | The last digit is even (0, 2, 4, 6, or 8).<ref name="Pascal's-criterion">This follows from Pascal's criterion. See Kisačanin (1998), {{Google books quote|id=BFtOuh5xGOwC|page=101|text=A number is divisible by|p. 100–101}}</ref><ref name="last-m-digits">A number is divisible by 2<sup>''m''</sup>, 5<sup>''m''</sup> or 10<sup>''m''</sup> if and only if the number formed by the last ''m'' digits is divisible by that number. See Richmond & Richmond (2009), {{Google books quote|id=HucyKYx0_WwC|page=105|text=formed by the last|p. 105}}</ref>
| |
| | 1,294: 4 is even.
| |
| |-
| |
| |rowspan=2| '''[[3 (number)|3]]'''
| |
| | Sum the digits. If the result is divisible by 3, then the original number is divisible by 3.<ref name="Pascal's-criterion"/><ref name="apostol-1976">Apostol (1976), {{Google books quote|id=Il64dZELHEIC|page=108|text=sum of its digits|p. 108}}</ref><ref name="Richmond-Richmond-2009">Richmond & Richmond (2009), {{Google books quote|id=HucyKYx0_WwC|page=102|text=divisible by|Section 3.4 (Divisibility Tests), p. 102–108}}</ref>
| |
| | 405 → 4 + 0 + 5 = 9 and 636 → 6 + 3 + 6 = 15 which both are clearly divisible by 3.<br>16,499,205,854,376 → 1+6+4+9+9+2+0+5+8+5+4+3+7+6 sums to 69 → 6 + 9 = 15 → 1 + 5 = 6, which is clearly divisible by 3.
| |
| |-
| |
| | Subtract the quantity of the digits 2, 5 and 8 in the number from the quantity of the digits 1, 4 and 7 in the number.
| |
| | Using the example above: 16,499,205,854,376 has '''four''' of the digits 1, 4 and 7; '''four''' of the digits 2, 5 and 8; ∴ Since 4 − 4 = 0 is a multiple of 3, the number 16,499,205,854,376 is divisible by 3.
| |
| |-
| |
| |rowspan=3| '''[[4 (number)|4]]'''
| |
| | Examine the last two digits.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | 40832: 32 is divisible by 4.
| |
| |-
| |
| | If the tens digit is even, the ones digit must be 0, 4, or 8.<br>If the tens digit is odd, the ones digit must be 2 or 6.
| |
| | 40832: 3 is odd, and the last digit is 2.
| |
| |-
| |
| | Twice the tens digit, plus the ones digit.
| |
| | 40832: 2 × 3 + 2 = 8, which is divisible by 4.
| |
| |-
| |
| | '''[[5 (number)|5]]'''
| |
| | The last digit is 0 or 5.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | 495: the last digit is 5.
| |
| |-
| |
| | '''[[6 (number)|6]]'''
| |
| | It is divisible by 2 and by 3.<ref name="product-of-coprimes">Richmond & Richmond (2009), {{Google books quote|id=HucyKYx0_WwC|page=102|text=divisible by the product|Section 3.4 (Divisibility Tests), Theorem 3.4.3, p. 107}}</ref>
| |
| | 1,458: 1 + 4 + 5 + 8 = 18, so it is divisible by 3 and the last digit is even, hence the number is divisible by 6.
| |
| |-
| |
| |rowspan=5| '''[[7 (number)|7]]'''
| |
| | Form the [[alternating sum]] of blocks of three from right to left.<ref name="Richmond-Richmond-2009"/><ref name="alternating-sum-of-blocks-of-three">Kisačanin (1998), {{Google books quote|id=BFtOuh5xGOwC|page=101|text=third criterion for 11|p. 101}}</ref>
| |
| | 1,369,851: 851 − 369 + 1 = 483 = 7 × 69
| |
| |-
| |
| | Subtract 2 times the last digit from the rest. (Works because 21 is divisible by 7.)
| |
| | 483: 48 − (3 × 2) = 42 = 7 × 6.
| |
| |-
| |
| | Or, add 5 times the last digit to the rest. (Works because 49 is divisible by 7.)
| |
| | 483: 48 + (3 × 5) = 63 = 7 × 9.
| |
| |-
| |
| | Or, add 3 times the first digit to the next. (This works because 10''a'' + ''b'' − 7''a'' = 3''a'' + ''b'' − last number has the same remainder)
| |
| | 483: 4×3 + 8 = 20 remainder 6, 6×3 + 3 = 21.
| |
| |-
| |
| | Multiply each digit (from right to left) by the digit in the corresponding position in this pattern (from left to right): 1, 3, 2, -1, -3, -2 (repeating for digits beyond the hundred-thousands place). Then sum the results.
| |
| | 483595: (4 × (-2)) + (8 × (-3)) + (3 × (-1)) + (5 × 2) + (9 × 3) + (5 × 1) = 7.
| |
| |-
| |
| |rowspan=5| '''[[8 (number)|8]]'''
| |
| |style="border-bottom: hidden;"| If the hundreds digit is even, examine the number formed by the last two digits.
| |
| |style="border-bottom: hidden;"| 624: 24.
| |
| |-
| |
| | If the hundreds digit is odd, examine the number obtained by the last two digits plus 4.
| |
| | 352: 52 + 4 = 56.
| |
| |-
| |
| | Add the last digit to twice the rest.
| |
| | 56: (5 × 2) + 6 = 16.
| |
| |-
| |
| | Examine the last three digits.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | 34152: Examine divisibility of just 152: 19 × 8
| |
| |-
| |
| | Add four times the hundreds digit to twice the tens digit to the ones digit.
| |
| | 34152: 4 × 1 + 5 × 2 + 2 = 16
| |
| |-
| |
| | '''[[9 (number)|9]]'''
| |
| | Sum the digits. If the result is divisible by 9, then the original number is divisible by 9.<ref name="Pascal's-criterion"/><ref name="apostol-1976"/><ref name="Richmond-Richmond-2009"/>
| |
| | 2,880: 2 + 8 + 8 + 0 = 18: 1 + 8 = 9.
| |
| |-
| |
| | '''[[10 (number)|10]]'''
| |
| | The last digit is 0.<ref name="last-m-digits"/>
| |
| | 130: the last digit is 0.
| |
| |-
| |
| |rowspan=5| '''[[11 (number)|11]]'''
| |
| | Form the alternating sum of the digits.<ref name="Pascal's-criterion"/><ref name="Richmond-Richmond-2009"/>
| |
| | 918,082: 9 − 1 + 8 − 0 + 8 − 2 = 22.
| |
| |-
| |
| | Add the digits in blocks of two from right to left.<ref name="Pascal's-criterion"/>
| |
| | 627: 6 + 27 = 33.
| |
| |-
| |
| | Subtract the last digit from the rest.
| |
| | 627: 62 − 7 = 55.
| |
| |-
| |
| | If the number of digits is even, add the first and subtract the last digit from the rest.
| |
| | 918,082: the number of digits is even (6) → 1808 + 9 − 2 = 1815: 81 + 1 − 5 = 77 = 7 × 11
| |
| |-
| |
| | If the number of digits is odd, subtract the first and last digit from the rest.
| |
| | 14,179: the number of digits is odd (5) → 417 − 1 − 9 = 407 = 37 × 11
| |
| |-
| |
| |rowspan=2| '''[[12 (number)|12]]'''
| |
| | It is divisible by 3 and by 4.<ref name="product-of-coprimes"/>
| |
| | 324: it is divisible by 3 and by 4.
| |
| |-
| |
| | Subtract the last digit from twice the rest.
| |
| | 324: 32 × 2 − 4 = 60.
| |
| |-
| |
| |rowspan=3| '''[[13 (number)|13]]'''
| |
| | Form the [[alternating sum]] of blocks of three from right to left.<ref name="alternating-sum-of-blocks-of-three"/>
| |
| | 2,911,272: −2 + 911 − 272 = 637
| |
| |-
| |
| | Add 4 times the last digit to the rest.
| |
| | 637: 63 + 7 × 4 = 91, 9 + 1 × 4 = 13.
| |
| |-
| |
| | Multiply each digit (from right to left) by the digit in the corresponding position in this pattern (from left to right): -3, -4, -1, 3, 4, 1 (repeating for digits beyond the hundred-thousands place). Then sum the results.<ref>http://www.tavas.net/index.php?op=NEArticle&sid=3358 New divisibility by 13 rule was found by Ethem Deynek, Turkish teacher</ref>
| |
| | 30,747,912: (2 × (-3)) + (1 × (-4)) + (9 × (-1)) + (7 × 3) + (4 × 4) + (7 × 1) + (0 × (-3)) + (3 × (-4)) = 13.
| |
| |-
| |
| |rowspan=2| '''[[14 (number)|14]]'''
| |
| | It is divisible by 2 and by 7.<ref name="product-of-coprimes"/>
| |
| | 224: it is divisible by 2 and by 7.
| |
| |-
| |
| | Add the last two digits to twice the rest. The answer must be divisible by 14.
| |
| | 364: 3 × 2 + 64 = 70.<br />1764: 17 × 2 + 64 = 98.
| |
| |-
| |
| | '''[[15 (number)|15]]'''
| |
| | It is divisible by 3 and by 5.<ref name="product-of-coprimes"/>
| |
| | 390: it is divisible by 3 and by 5.
| |
| |-
| |
| |rowspan=4| '''[[16 (number)|16]]'''
| |
| | If the thousands digit is even, examine the number formed by the last three digits.
| |
| | 254,176: 176.
| |
| |-
| |
| | If the thousands digit is odd, examine the number formed by the last three digits plus 8.
| |
| | 3,408: 408 + 8 = 416.
| |
| |-
| |
| | Add the last two digits to four times the rest.
| |
| | 176: 1 × 4 + 76 = 80.
| |
| | |
| 1168: 11 × 4 + 68 = 112.
| |
| |-
| |
| | Examine the last four digits.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | 157,648: 7,648 = 478 × 16.
| |
| |-
| |
| | '''[[17 (number)|17]]'''
| |
| | Subtract 5 times the last digit from the rest.
| |
| | 221: 22 − 1 × 5 = 17.
| |
| |-
| |
| | '''[[18 (number)|18]]'''
| |
| | It is divisible by 2 and by 9.<ref name="product-of-coprimes"/>
| |
| | 342: it is divisible by 2 and by 9.
| |
| |-
| |
| | '''[[19 (number)|19]]'''
| |
| | Add twice the last digit to the rest.
| |
| | 437: 43 + 7 × 2 = 57.
| |
| |-
| |
| |rowspan=2| '''[[20 (number)|20]]'''
| |
| | It is divisible by 10, and the tens digit is even.
| |
| | 360: is divisible by 10, and 6 is even.
| |
| |-
| |
| | If the number formed by the last two digits is divisible by 20.
| |
| | 480: 80 is divisible by 20.
| |
| |}
| |
| | |
| ==Step-by-step examples==
| |
| | |
| ===Divisibility by 2===
| |
| First, take any even number (for this example it will be 376) and note the last digit in the number, discarding the other digits. Then take that digit (6) while ignoring the rest of the number and determine if it is divisible by 2. If it is divisible by 2, then the original number is divisible by 2.
| |
| | |
| '''Example'''
| |
| # 376 (The original number)
| |
| # <s>37</s> <u>6</u> (Take the last digit)
| |
| # 6 ÷ 2 = 3 (Check to see if the last digit is divisible by 2)
| |
| # 376 ÷ 2 = 188 (If the last digit is divisible by 2, then the whole number is divisible by 2)
| |
| | |
| ===Divisibility by 3===
| |
| First, take any number (for this example it will be 492) and add together each digit in the number (4 + 9 + 2 = 15). Then take that sum (15) and determine if it is divisible by 3. The original number is divisible by 3 if and only if the final number is divisible by 3.
| |
| | |
| If a number is a multiplication of 3 consecutive numbers then that number is always divisible by 3. This is useful for when the number takes the form of (''n'' × (''n'' − 1) × (''n'' + 1))
| |
| | |
| '''Ex.'''
| |
| # 492 (The original number)
| |
| # 4 + 9 + 2 = 15 (Add each individual digit together)
| |
| # 15 is divisible by 3 at which point we can stop. Alternatively we can continue using the same method if the number is still too large:
| |
| # 1 + 5 = 6 (Add each individual digit together)
| |
| # 6 ÷ 3 = 2 (Check to see if the number received is divisible by 3)
| |
| # 492 ÷ 3 = 164 (If the number obtained by using the rule is divisible by 3, then the whole number is divisible by 3)
| |
| | |
| '''Ex.'''
| |
| # 336 (The original number)
| |
| # 6 × 7 × 8 = 336
| |
| # 336 ÷ 3 = 112
| |
| | |
| ===Divisibility by 4===
| |
| The basic rule for divisibility by 4 is that if the number formed by the last two digits in a number is divisible by 4, the original number is divisible by 4;<ref name="Pascal's-criterion"/><ref name="last-m-digits"/> this is because 100 is divisible by 4 and so adding hundreds, thousands, etc. is simply adding another number that is divisible by 4. If any number ends in a two digit number that you know is divisible by 4 (e.g. 24, 04, 08, etc.), then the whole number will be divisible by 4 regardless of what is before the last two digits.
| |
| | |
| Alternatively, one can simply divide the number by 2, and then check the result to find if it is divisible by 2. If it is, the original number is divisible by 4. In addition, the result of this test is the same as the original number divided by 4.
| |
| | |
| '''Ex.'''<br>
| |
| '''General rule'''
| |
| # 2092 (The original number)
| |
| # <s>20</s> <u>92</u> (Take the last two digits of the number, discarding any other digits)
| |
| # 92 ÷ 4 = 23 (Check to see if the number is divisible by 4)
| |
| # 2092 ÷ 4 = 523 (If the number that is obtained is divisible by 4, then the original number is divisible by 4)
| |
| | |
| '''Alternative example'''
| |
| # 1720 (The original number)
| |
| # 1720 ÷ 2 = 860 (Divide the original number by 2)
| |
| # 860 ÷ 2 = 430 (Check to see if the result is divisible by 2)
| |
| # 1720 ÷ 4 = 430 (If the result is divisible by 2, then the original number is divisible by 4)
| |
| | |
| ===Divisibility by 5===
| |
| Divisibility by 5 is easily determined by checking the last digit in the number (47'''5'''), and seeing if it is either 0 or 5. If the last number is either 0 or 5, the entire number is divisible by 5.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | |
| If the last digit in the number is 0, then the result will be the remaining digits multiplied by 2. For example, the number 40 ends in a zero (0), so take the remaining digits (4) and multiply that by two (4 × 2 = 8). The result is the same as the result of 40 divided by 5(40/5 = 8).
| |
| | |
| If the last digit in the number is 5, then the result will be the remaining digits multiplied by two (2), plus one (1). For example, the number 125 ends in a 5, so take the remaining digits (12), multiply them by two (12 × 2 = 24), then add one (24 + 1 = 25). The result is the same as the result of 125 divided by 5 (125/5=25).
| |
| | |
| '''Ex.'''<br>
| |
| ''' If the last digit is 0'''
| |
| # 110 (The original number)
| |
| # <s>11</s> <u>0</u> (Take the last digit of the number, and check if it is 0 or 5)
| |
| # <u>11</u> <s>0</s> (If it is 0, take the remaining digits, discarding the last)
| |
| # 11 × 2 = 22 (Multiply the result by 2)
| |
| # 110 ÷ 5 = 22 (The result is the same as the original number divided by 5)
| |
| | |
| '''If the last digit is 5'''
| |
| # 85 (The original number)
| |
| # <s>8</s> <u>5</u> (Take the last digit of the number, and check if it is 0 or 5)
| |
| # <u>8</u> <s>5</s> (If it is 5, take the remaining digits, discarding the last)
| |
| # 8 × 2 = 16 (Multiply the result by 2)
| |
| # 16 + 1 = 17 (Add 1 to the result)
| |
| # 85 ÷ 5 = 17 (The result is the same as the original number divided by 5)
| |
| | |
| ===Divisibility by 6===
| |
| Divisibility by 6 is determined by checking the original number to see if it is both an even number ([[#Divisibility by 2|divisible by 2]]) and [[#Divisibility by 3|divisible by 3]].<ref name="product-of-coprimes"/> This is the best test to use.
| |
| | |
| Alternatively, one can check for divisibility by six by taking the number (246), dropping the last digit in the number (<u>24</u> <s>6</s>, adding together the remaining number (24 becomes 2 + 4 = 6), multiplying that by four (6 × 4 = 24), and adding the last digit of the original number to that (24 + 6 = 30). If this number is divisible by six, the original number is divisible by 6.
| |
| | |
| If the number is divisible by six, take the original number (246) and divide it by two (246 ÷ 2 = 123). Then, take that result and divide it by three (123 ÷ 3 = 41). This result is the same as the original number divided by six (246 ÷ 6 = 41).
| |
| | |
| '''Ex.'''<br>
| |
| '''General rule'''
| |
| # 324 (The original number)
| |
| # 324 ÷ 3 = 108 (Check to see if the original number is divisible by 3)
| |
| # 324 ÷ 2 = 162 '''OR''' 108 ÷ 2 = 54 (Check to see if either the original number or the result of the previous equation is divisible by 2)
| |
| # 324 ÷ 6 = 54 (If either of the tests in the last step are true, then the original number is divisible by 6. Also, the result of the second test returns the same result as the original number divided by 6)
| |
| | |
| <br>'''Finding a remainder of a number when divided by 6''' <br>
| |
| 6 − (1, −2, −2, −2, −2, and −2 goes on for the rest) No period.
| |
| <br> Minimum magnitude sequence <br>
| |
| (1, 4, 4, 4, 4, and 4 goes on for the rest)
| |
| <br>Positive sequence <br>
| |
| Multiply the right most digit by the left most digit in the sequence and multiply the second right most digit by the second left most digit in the sequence and so on. Next, compute the sum of all the values and take the remainder on division by 6.
| |
| <br>Example: What is the remainder when 1036125837 is divided by 6? <br>
| |
| Multiplication of the rightmost digit = 1 × 7 = 7
| |
| <br>Multiplication of the second rightmost digit = 3 × −2 = −6 <br>
| |
| Third rightmost digit = −16
| |
| <br>Fourth rightmost digit = −10 <br>
| |
| Fifth rightmost digit = −4
| |
| <br>Sixth rightmost digit = −2 <br>
| |
| Seventh rightmost digit = −12
| |
| <br> Eighth rightmost digit = −6 <br>
| |
| Ninth rightmost digit = 0
| |
| <br>Tenth rightmost digit = −2 <br>
| |
| Sum = −51
| |
| <br>−51 modulo 6 = 3 <br>
| |
| Remainder = 3
| |
| | |
| ===Divisibility by 7===
| |
| {{Cleanup|section|date=August 2010}}
| |
| Divisibility by 7 can be tested by a recursive method. A number of the form 10''x'' + ''y'' is divisible by 7 if and only if ''x'' − 2''y'' is divisible by 7. In other words, subtract twice the last digit from the number formed by the remaining digits. Continue to do this until a number known to be divisible by 7 is obtained. The original number is divisible by 7 if and only if the number obtained using this procedure is divisible by 7. For example, the number 371: 37 − (2×1) = 37 − 2 = 35; 3 − (2 × 5) = 3 − 10 = −7; thus, since −7 is divisible by 7, 371 is divisible by 7.
| |
| | |
| Another method is multiplication by 3. A number of the form 10''x'' + ''y'' has the same remainder when divided by 7 as 3''x'' + ''y''. One must multiply the leftmost digit of the original number by 3, add the next digit, take the remainder when divided by 7, and continue from the beginning: multiply by 3, add the next digit, etc. For example, the number 371: 3×3 + 7 = 16 remainder 2, and 2×3 + 1 = 7. This method can be used to find the remainder of division by 7.
| |
| | |
| A more complicated algorithm for testing divisibility by 7 uses the fact that 10<sup>0</sup> ≡ 1, 10<sup>1</sup> ≡ 3, 10<sup>2</sup> ≡ 2, 10<sup>3</sup> ≡ 6, 10<sup>4</sup> ≡ 4, 10<sup>5</sup> ≡ 5, 10<sup>6</sup> ≡ 1, ... (mod 7). Take each digit of the number (371) in reverse order (173), multiplying them successively by the digits '''1''', '''3''', '''2''', '''6''', '''4''', '''5''', repeating with this sequence of multipliers as long as necessary (1, 3, 2, 6, 4, 5, 1, 3, 2, 6, 4, 5, ...), and adding the products (1×'''1''' + 7×'''3''' + 3×'''2''' = 1 + 21 + 6 = 28). The original number is divisible by 7 if and only if the number obtained using this procedure is divisible by 7 (hence 371 is divisible by 7 since 28 is).<ref name="7Divis1">{{cite web
| |
| | last = Su
| |
| | first = Francis E.
| |
| | title = "Divisibility by Seven" ''Mudd Math Fun Facts''
| |
| | url = http://www.math.hmc.edu/funfacts/ffiles/10005.5.shtml
| |
| | accessdate = 2006-12-12 }}</ref>
| |
| | |
| This method can be simplified by removing the need to multiply. All it would take with this simplification is to memorize the sequence above (132645...), and to add and subtract, but always working with one-digit numbers.
| |
| | |
| The simplification goes as follows:
| |
| | |
| *Take for instance the number '''371'''
| |
| *Change all occurrences of '''7''', '''8''' or '''9''' into '''0''', '''1''' and '''2''', respectively. In this example, we get: '''301'''. This second step may be skipped, except for the left most digit, but following it may facilitate calculations later on.
| |
| *Now convert the first digit (3) into the following digit in the sequence '''13264513...''' In our example, 3 becomes '''2'''.
| |
| *Add the result in the previous step (2) to the second digit of the number, and substitute the result for both digits, leaving all remaining digits unmodified: 2 + 0 = 2. So ''30''1 becomes '''''2''1'''.
| |
| *Repeat the procedure until you have a recognizable multiple of 7, or to make sure, a number between 0 and 6. So, starting from 21 (which is a recognizable multiple of 7), take the first digit (2) and convert it into the following in the sequence above: 2 becomes 6. Then add this to the second digit: 6 + 1 = '''7'''.
| |
| *If at any point the first digit is 8 or 9, these become 1 or 2, respectively. But if it is a 7 it should become 0, only if no other digits follow. Otherwise, it should simply be dropped. This is because that 7 would have become 0, and numbers with at least two digits before the decimal dot do not begin with 0, which is useless. According to this, our 7 becomes '''0'''.
| |
| | |
| If through this procedure you obtain a '''0''' or any recognizable multiple of 7, then the original number is a multiple of 7. If you obtain any number from '''1''' to '''6''', that will indicate how much you should subtract from the original number to get a multiple of 7. In other words, you will find the [[remainder]] of dividing the number by 7. For example take the number '''186''':
| |
| | |
| *First, change the 8 into a 1: '''116'''.
| |
| *Now, change 1 into the following digit in the sequence (3), add it to the second digit, and write the result instead of both: 3 + 1 = ''4''. So ''11''6 becomes now '''''4''6'''.
| |
| *Repeat the procedure, since the number is greater than 7. Now, 4 becomes 5, which must be added to 6. That is '''11'''.
| |
| *Repeat the procedure one more time: 1 becomes 3, which is added to the second digit (1): 3 + 1 = '''4'''.
| |
| | |
| Now we have a number lower than 7, and this number (4) is the remainder of dividing 186/7. So 186 minus 4, which is 182, must be a multiple of 7.
| |
| | |
| Note: The reason why this works is that if we have: '''a+b=c''' and '''b''' is a multiple of any given number '''n''', then '''a''' and '''c''' will necessarily produce the same remainder when divided by '''n'''. In other words, in 2 + 7 = 9, 7 is divisible by 7. So 2 and 9 must have the same reminder when divided by 7. The remainder is 2.
| |
| | |
| Therefore, if a number ''n'' is a multiple of 7 (i.e.: the remainder of ''n''/7 is 0), then adding (or subtracting) multiples of 7 cannot possibly change that property.
| |
| | |
| What this procedure does, as explained above for most divisibility rules, is simply subtract little by little multiples of 7 from the original number until reaching a number that is small enough for us to remember whether it is a multiple of 7. If 1 becomes a 3 in the following decimal position, that is just the same as converting 10×10<sup>''n''</sup> into a 3×10<sup>''n''</sup>. And that is actually the same as subtracting 7×10<sup>''n''</sup> (clearly a multiple of 7) from 10×10<sup>''n''</sup>.
| |
| | |
| Similarly, when you turn a 3 into a 2 in the following decimal position, you are turning 30×10<sup>''n''</sup> into 2×10<sup>''n''</sup>, which is the same as subtracting 30×10<sup>''n''</sup>−28×10<sup>n</sup>, and this is again subtracting a multiple of 7. The same reason applies for all the remaining conversions:
| |
| | |
| * 20×10<sup>''n''</sup> − 6×10<sup>''n''</sup>='''14'''×10<sup>''n''</sup>
| |
| * 60×10<sup>''n''</sup> − 4×10<sup>''n''</sup>='''56'''×10<sup>''n''</sup>
| |
| * 40×10<sup>''n''</sup> − 5×10<sup>''n''</sup>='''35'''×10<sup>''n''</sup>
| |
| * 50×10<sup>''n''</sup> − 1×10<sup>''n''</sup>='''49'''×10<sup>''n''</sup>
| |
| | |
| '''First method example'''<br>
| |
| 1050 → 105 − 0=105 → 10 − 10 = 0. ANSWER: 1050 is divisible by 7.
| |
| | |
| '''Second method example'''<br>
| |
| 1050 → 0501 (reverse) → 0×'''1''' + 5×'''3''' + 0×'''2''' + 1×'''6''' = 0 + 15 + 0 + 6 = 21 (multiply and add). ANSWER: 1050 is divisible by 7.
| |
| | |
| '''Vedic method of divisibility by osculation'''<br>
| |
| Divisibility by seven can be tested by multiplication by the ''Ekhādika''. Convert the divisor seven to the nines family by multiplying by seven. 7×7=49. Add one, drop the units digit and, take the 5, the ''Ekhādika'', as the multiplier. Start on the right. Multiply by 5, add the product to the next digit to the left. Set down that result on a line below that digit. Repeat that method of multiplying the units digit by five and adding that product to the number of tens. Add the result to the next digit to the left. Write down that result below the digit. Continue to the end. If the end result is zero or a multiple of seven, then yes, the number is divisible by seven. Otherwise, it is not. This follows the Vedic ideal, one-line notation.<ref>Page 274, '''Vedic Mathematics: Sixteen Simple Mathematical Formulae''', by Swami Sankaracarya, published by Motilal Banarsidass, Varanasi, India, 1965, Delhi, 1978. 367 pages.</ref>
| |
| | |
| '''Vedic method example:'''
| |
| Is 438,722,025 divisible by seven? Multiplier = 5.
| |
| 4 3 8 7 2 2 0 2 5
| |
| 42 37 46 37 6 40 37 27
| |
| YES
| |
| | |
| '''Pohlman–Mass method of divisibility by 7'''<br>
| |
| The Pohlman–Mass method provides a quick solution that can determine if most integers are divisible by seven in three steps or less. This method could be useful in a mathematics competition such as MATHCOUNTS, where time is a factor to determine the solution without a calculator in the Sprint Round.
| |
| | |
| Step A:
| |
| If the integer is 1,000 or less, subtract twice the last digit from the number formed by the remaining digits. If the result is a multiple of seven, then so is the original number (and vice versa). For example:
| |
| | |
| 112 -> 11 − (2×2) = 11 − 4 = 7 YES
| |
| 98 -> 9 − (8×2) = 9 − 16 = −7 YES
| |
| 634 -> 63 − (4×2) = 63 − 8 = 55 NO
| |
| | |
| Because 1,001 is divisible by seven, an interesting pattern develops for repeating sets of 1, 2, or 3 digits that form 6-digit numbers (leading zeros are allowed) in that all such numbers are divisible by seven. For example:
| |
| | |
| 001 001 = 1,001 / 7 = 143
| |
| 010 010 = 10,010 / 7 = 1,430
| |
| 011 011 = 11,011 / 7 = 1,573
| |
| 100 100 = 100,100 / 7 = 14,300
| |
| 101 101 = 101,101 / 7 = 14,443
| |
| 110 110 = 110,110 / 7 = 15,730
| |
| | |
| 01 01 01 = 10,101 / 7 = 1,443
| |
| 10 10 10 = 101,010 / 7 = 14,430
| |
| | |
| 111,111 / 7 = 15,873
| |
| 222,222 / 7 = 31,746
| |
| 999,999 / 7 = 142,857
| |
| | |
| 576,576 / 7 = 82,368
| |
| | |
| For all of the above examples, subtracting the first three digits from the last three results in a multiple of seven. Notice that leading zeros are permitted to form a 6-digit pattern.
| |
| | |
| This phenomenon forms the basis for Steps B and C.
| |
| | |
| Step B:
| |
| If the integer is between 1,001 and one million, find a repeating pattern of 1, 2, or 3 digits that forms a 6-digit number that is close to the integer (leading zeros are allowed and can help you visualize the pattern). If the positive difference is less than 1,000, apply Step A. This can be done by subtracting the first three digits from the last three digits. For example:
| |
| | |
| 341,355 − 341,341 = 14 -> 1 − (4×2) = 1 − 8 = −7 YES
| |
| 67,326 − 067,067 = 259 -> 25 − (9×2) = 25 − 18 = 7 YES
| |
| | |
| The fact that 999,999 is a multiple of 7 can be used for determining divisibility of integers larger than one million by reducing the integer to a 6-digit number that can be determined using Step B. This can be done easily by adding the digits left of the first six to the last six and follow with Step A.
| |
| | |
| Step C:
| |
| If the integer is larger than one million, subtract the nearest multiple of 999,999 and then apply Step B. For even larger numbers, use larger sets such as 12-digits (999,999,999,999) and so on. Then, break the integer into a smaller number that can be solved using Step B. For example:
| |
| | |
| 22,862,420 − (999,999 × 22) = 22,862,420 − 21,999,978 -> 862,420 + 22 = 862,442
| |
| 862,442 -> 862 − 442 (Step B) = 420 -> 42 − (0×2) (Step A) = 42 YES
| |
| | |
| This allows adding and subtracting alternating sets of three digits to determine divisibility by seven. Understanding these patterns allows you to quickly calculate divisibility of seven as seen in the following examples:
| |
| | |
| '''Pohlman–Mass method of divisibility by 7, examples:'''
| |
| | |
| Is 98 divisible by seven?
| |
| 98 -> 9 − (8×2) = 9 − 16 = −7 YES (Step A)
| |
| | |
| Is 634 divisible by seven?
| |
| 634 -> 63 − (4×2) = 63 − 8 = 55 NO (Step A)
| |
| | |
| Is 355,341 divisible by seven?
| |
| 355,341 − 341,341 = 14,000 (Step B) -> 014 − 000 (Step B) -> 14 = 1 − (4×2) (Step A) = 1 − 8 = −7 YES
| |
| | |
| Is 42,341,530 divisible by seven?
| |
| 42,341,530 -> 341,530 + 42 = 341,572 (Step C)
| |
| 341,572 − 341,341 = 231 (Step B)
| |
| 231 -> 23 − (1×2) = 23 − 2 = 21 YES (Step A)
| |
| | |
| Using quick alternating additions and subtractions:
| |
| 42,341,530 -> 530 − 341 = 189 + 42 = 231 -> 23 − (1×2) = 21 YES
| |
| | |
| '''Multiplication by 3 method of divisibility by 7, examples:'''
| |
| | |
| Is 98 divisible by seven?
| |
| 98 -> 9 remainder 2 -> 2×3 + 8 = 14 YES
| |
| | |
| Is 634 divisible by seven?
| |
| 634 -> 6×3 + 3 = 21 -> remainder 0 -> 0×3 + 4 = 4 NO
| |
| | |
| Is 355,341 divisible by seven?
| |
| 3 * 3 + 5 = 14 -> remainder 0 -> 0×3 + 5 = 5 -> 5×3 + 3 = 18 -> remainder 4 -> 4×3 + 4 = 16 -> remainder 2 -> 2×3 + 1 = 7 YES
| |
| | |
| Find remainder of 1036125837 divided by 7
| |
| 1×3 + 0 = 3
| |
| 3×3 + 3 = 12 remainder 5
| |
| 5×3 + 6 = 21 remainder 0
| |
| 0×3 + 1 = 1
| |
| 1×3 + 2 = 5
| |
| 5×3 + 5 = 20 remainder 6
| |
| 6×3 + 8 = 26 remainder 5
| |
| 5×3 + 3 = 18 remainder 4
| |
| 4×3 + 7 = 19 remainder 5
| |
| Answer is 5
| |
| | |
| '''Finding remainder of a number when divided by 7'''
| |
| | |
| 7 − (1, 3, 2, −1, −3, −2, cycle repeats for the next six digits) Period: 6 digits.
| |
| Recurring numbers: 1, 3, 2, −1, −3, −2
| |
| <br>Minimum magnitude sequence <br>
| |
| (1, 3, 2, 6, 4, 5, cycle repeats for the next six digits) Period: 6 digits.
| |
| Recurring numbers: 1, 3, 2, 6, 4, 5
| |
| <br>Positive sequence
| |
| | |
| Multiply the right most digit by the left most digit in the sequence and multiply the second right most digit by the second left most digit in the sequence and so on and so for. Next, compute the sum of all the values and take the modulus of 7.
| |
| <br>Example: What is the remainder when 1036125837 is divided by 7? <br>
| |
| <br>Multiplication of the rightmost digit = 1 × 7 = 7 <br>
| |
| <br>Multiplication of the second rightmost digit = 3 × 3 = 9 <br>
| |
| <br>Third rightmost digit = 8 × 2 = 16 <br>
| |
| <br>Fourth rightmost digit = 5 × −1 = −5 <br>
| |
| <br>Fifth rightmost digit = 2 × −3 = −6 <br>
| |
| <br>Sixth rightmost digit = 1 × −2 = −2 <br>
| |
| <br>Seventh rightmost digit = 6 × 1 = 6 <br>
| |
| <br>Eighth rightmost digit = 3 × 3 = 9 <br>
| |
| <br>Ninth rightmost digit = 0 <br>
| |
| <br>Tenth rightmost digit = 1 × −1 = −1 <br>
| |
| <br>Sum = 33 <br>
| |
| <br>33 modulus 7 = 5 <br>
| |
| <br>Remainder = 5
| |
| | |
| '''Digit pair method of divisibility by 7'''
| |
| | |
| This method uses '''1''', '''−3''', '''2''' pattern on the ''digit pairs''. That is, the divisibility of any number by seven can be tested by first separating the number into digit pairs, and then applying the algorithm on three digit pairs (six digits). When the number is smaller than six digits, then fill zero’s to the right side until there are six digits. When the number is larger than six digits, then repeat the cycle on the next six digit group and then add the results. Repeat the algorithm until the result is a small number. The original number is divisible by seven if and only if the number obtained using this algorithm is divisible by seven. This method is especially suitable for large numbers.
| |
| | |
| ''Example 1:''<br>
| |
| The number to be tested is 157514.
| |
| First we separate the number into three digit pairs: 15, 75 and 14.<br>
| |
| Then we apply the algorithm: '''1''' × 15 '''− 3''' × 75 + '''2''' × 14 = 182<br>
| |
| Because the resulting 182 is less than six digits, we add zero’s to the right side until it is six digits.<br>
| |
| Then we apply our algorithm again: '''1''' × 18 '''− 3''' × 20 + '''2''' × 0 = −42<br>
| |
| The result −42 is divisible by seven, thus the original number 157514 is divisible by seven.
| |
| | |
| ''Example 2:''<br>
| |
| The number to be tested is 15751537186.<br>
| |
| ('''1''' × 15 '''− 3''' × 75 + '''2''' × 15) + ('''1''' × 37 '''− 3''' × 18 + '''2''' × 60) = −180 + 103 = −77<br>
| |
| The result −77 is divisible by seven, thus the original number 15751537186 is divisible by seven.
| |
| | |
| ===Divisibility by 13===
| |
| Remainder Test
| |
| 13 (1, −3, −4, −1, 3, 4, cycle goes on.)
| |
| If you are not comfortable with negative numbers, then use this sequence. (1, 10, 9, 12, 3, 4)
| |
| | |
| Multiply the right most digit of the number with the left most number in the sequence shown above and the second right most digit to the second left most digit of the number in the sequence. The cycle goes on.
| |
| | |
| Example: What is the remainder when 321 is divided by 13?<br/>
| |
| Using the first sequence, <br>
| |
| Ans: '''1''' × 1 + '''2''' × −3 + '''3''' × −4 = 9<br/>
| |
| Remainder = −17 mod 13 = 9
| |
| | |
| Example: What is the remainder when 1234567 is divided by 13?<br/>
| |
| Using the second sequence, <br>
| |
| Answer: '''7''' × 1 + '''6''' × 10 + '''5''' × 9 + '''4''' × 12 + '''3''' × 3 + '''2''' × 4 + '''1''' × 1 = 178 mod 13 = 9<br/>
| |
| Remainder = 9
| |
| | |
| ==Beyond 20==
| |
| Divisibility properties can be determined in two ways, depending on the type of the divisor.
| |
| | |
| === Composite divisors ===
| |
| A number is divisible by a given divisor if it is divisible by the highest power of each of its [[prime number|prime]] factors. For example, to determine divisibility by 24, check divisibility by 8 and by 3.<ref name="product-of-coprimes"/> Note that checking 4 and 6, or 2 and 12, would not be sufficient. A [[table of prime factors]] may be useful.
| |
| | |
| A [[Composite number|composite]] divisor may also have a rule formed using the same procedure as for a prime divisor, given below, with the caveat that the manipulations involved may not introduce any factor which is present in the divisor. For instance, one can not make a rule for 14 that involves multiplying the equation by 7. This is not an issue for prime divisors because they have no smaller factors.
| |
| | |
| === Prime divisors ===
| |
| The goal is to find an inverse to 10 modulo the prime (not 2 or 5) and use that as a multiplier to make the divisibility of the original number by that prime depend on the divisibility of the new (usually smaller) number by the same prime.
| |
| Using 17 as an example, since 10 × (−5) = −50 = 1 mod 17, we get the rule for using ''y'' − 5''x'' in the table above. In fact, this rule for prime divisors besides 2 and 5 is ''really'' a rule
| |
| for divisibility by any integer relatively prime to 10 (including 21 and 27; see tables below). This is why the last divisibility condition in the tables above and below for any number relatively prime to 10 has the same kind of form (add or subtract some multiple of the last digit from the rest of the number).
| |
| | |
| === Notable examples ===
| |
| The following table provides rules for a few more notable divisors:
| |
| | |
| {| class="wikitable"
| |
| !Divisor
| |
| !Divisibility condition
| |
| !Examples
| |
| |-
| |
| |'''[[21 (number)|21]]'''
| |
| |Subtract twice the last digit from the rest.
| |
| |168: 16 − (8×2) = 0, 168 is divisible.<br>1050: 105 − (0×2) = 105, 10 − (5×2) = 0, 1050 is divisible.
| |
| |-
| |
| |'''[[23 (number)|23]]'''
| |
| |Add 7 times the last digit to the rest.
| |
| |3128: 312 + (8×7) = 368, 368 ÷ 23 = 16.
| |
| |-
| |
| |'''[[25 (number)|25]]'''
| |
| |The number formed by the last two digits is divisible by 25.<ref name="last-m-digits"/>
| |
| |134,250: 50 is divisible by 25.
| |
| |-
| |
| |rowspan=2|'''[[27 (number)|27]]'''
| |
| |Sum the digits in blocks of three from right to left. If the result is divisible by 27, then the number is divisible by 27.
| |
| |2,644,272: 2 + 644 + 272 = 918 = 27×34.
| |
| |-
| |
| |Subtract 8 times the last digit from the rest.
| |
| |621: 62 − (1×8) = 54.
| |
| |-
| |
| |'''[[29 (number)|29]]'''
| |
| |Add three times the last digit to the rest.
| |
| |261: 1×3 = 3; 3 + 26 = 29
| |
| |-
| |
| |'''[[31 (number)|31]]'''
| |
| |Subtract three times the last digit from the rest.
| |
| |837: 83 − 3×7 = 62
| |
| |-
| |
| |rowspan=4|''' [[32 (number)|32]] '''
| |
| | style="border-bottom: hidden;" |The number formed by the last five digits is divisible by 32.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| | style="border-bottom: hidden;" |25,135,520: 35,520=1110×32
| |
| |-
| |
| | style="border-bottom: hidden;" |If the ten thousands digit is even, examine the number formed by the last four digits.
| |
| | style="border-bottom: hidden;" |41,312: 1312.
| |
| |-
| |
| |If the ten thousands digit is odd, examine the number formed by the last four digits plus 16.
| |
| |254,176: 4176+16 = 4192.
| |
| |-
| |
| |Add the last two digits to 4 times the rest.
| |
| |1,312: (13×4) + 12 = 64.
| |
| |-
| |
| |rowspan=2|''' [[33 (number)|33]] '''
| |
| |Add 10 times the last digit to the rest; it has to be divisible by 3 and 11.
| |
| |627: 62 + 7 × 10 = 132, <br>13 + 2 × 10 = 33.
| |
| |-
| |
| |Add the digits in blocks of two from right to left.
| |
| |2,145: 21 + 45 = 66.
| |
| |-
| |
| |''' [[35 (number)|35]] '''
| |
| |Number must be divisible by 7 ending in 0 or 5.
| |
| |700 is divisible by 7 ending in a 0.
| |
| |-
| |
| |rowspan=2|''' [[37 (number)|37]] '''
| |
| |Take the digits in blocks of three from right to left and add each block, just as for 27.
| |
| |2,651,272: 2 + 651 + 272 = 925. 925 = 37×25.
| |
| |-
| |
| |Subtract 11 times the last digit from the rest.
| |
| |925: 92 − (5×11) = 37.
| |
| |-
| |
| |'''[[39 (number)|39]]'''
| |
| |Add 4 times the last digit to the rest.
| |
| |351: 1 × 4 = 4; 4 + 35 = 39
| |
| |-
| |
| |'''[[41 (number)|41]]'''
| |
| |Subtract 4 times the last digit from the rest.
| |
| |738: 73 − 8 × 4 = 41.
| |
| |-
| |
| |rowspan=2|'''[[43 (number)|43]]'''
| |
| |Add 13 times the last digit to the rest.
| |
| |36,249: 3624 + 9 × 13 = 3741, <br>374 + 1 × 13 = 387, <br>38 + 7 × 13 = 129, <br>12 + 9 × 13 = 129 = 43 × 3.
| |
| |-
| |
| |Subtract 30 times the last digit from the rest.
| |
| |36,249: 3624 - 9 × 30 = 3354, <br> 335 - 4 × 30 = 215 = 43 × 5.
| |
| |-
| |
| |'''[[45 (number)|45]]'''
| |
| |The number must be divisible by 9 ending in 0 or 5.<ref name="product-of-coprimes"/>
| |
| |495: 4 + 9 + 5 = 18, 1 + 8 = 9; <br>(495 is divisible by both 5 and 9.)
| |
| |-
| |
| |'''[[47 (number)|47]]'''
| |
| |Subtract 14 times the last digit from the rest.
| |
| |1,642,979: 164297 − 9 × 14 = 164171, <br>16417 − 14 = 16403, <br>1640 − 3 × 14 = 1598, <br>159 − 8 × 14 = 47.
| |
| |-
| |
| |'''[[49 (number)|49]]'''
| |
| |Add 5 times the last digit to the rest.
| |
| |1,127: 112+(7×5)=147.<br>147: 14 + (7×5) = 49
| |
| |-
| |
| |'''[[50 (number)|50]]'''
| |
| |The last two digits are 00 or 50.
| |
| |134,250: 50.
| |
| |-
| |
| |'''[[51 (number)|51]]'''
| |
| |Subtract 5 times the last digit to the rest.
| |
| |204: 20-(4×5)=0
| |
| |-
| |
| |'''[[55 (number)|55]]'''
| |
| |Number must be divisible by 11 ending in 0 or 5.<ref name="product-of-coprimes"/>
| |
| |935: 93 − 5 = 88 or 9 + 35 = 44.
| |
| |-
| |
| |'''[[59 (number)|59]]'''
| |
| |Add 6 times the last digit to the rest.
| |
| |295: 5×6 = 30; 30 + 29 = 59
| |
| |-
| |
| |'''[[61 (number)|61]]'''
| |
| |Subtract 6 times the last digit from the rest.
| |
| |732: 73-(2×6)=61
| |
| |-
| |
| |'''[[64 (number)|64]]'''
| |
| |The number formed by the last six digits must be divisible by 64.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| |2,640,000 is divisible by 64.
| |
| |-
| |
| |'''[[65 (number)|65]]'''
| |
| |Number must be divisible by 13 ending in 0 or 5.<ref name="product-of-coprimes"/>
| |
| |130 is divisible by 13 ending in 0.
| |
| |-
| |
| |'''[[66 (number)|66]]'''
| |
| |Number must be divisible by 6 and 11.<ref name="product-of-coprimes"/>
| |
| |132 is divisible by 6 and 11.
| |
| |-
| |
| |'''[[69 (number)|69]]'''
| |
| |Add 7 times the last digit to the rest.
| |
| |345: 5×7 = 35; 35 + 34 = 69
| |
| |-
| |
| |'''[[71 (number)|71]]'''
| |
| |Subtract 7 times the last digit from the rest.
| |
| |852: 85-(2×7)=71
| |
| |-
| |
| |'''[[75 (number)|75]]'''
| |
| |Number must be divisible by 3 ending in 00, 25, 50 or 75.<ref name="product-of-coprimes"/>
| |
| |825: ends in 25 and is divisible by 3.
| |
| |-
| |
| |'''[[77 (number)|77]]'''
| |
| |Form the alternating sum of blocks of three from right to left.
| |
| |76,923: 923 - 76 = 847.
| |
| |-
| |
| |'''[[79 (number)|79]]'''
| |
| |Add 8 times the last digit to the rest.
| |
| |711: 1×8 = 8; 8 + 71 = 79
| |
| |-
| |
| |'''[[81 (number)|81]]'''
| |
| |Subtract 8 times the last digit from the rest.
| |
| |162: 16-(2×8)=0
| |
| |-
| |
| |'''[[89 (number)|89]]'''
| |
| |Add 9 times the last digit to the rest.
| |
| |801: 1×9 = 9; 80 + 9 = 89
| |
| |-
| |
| |rowspan=2|'''[[91 (number)|91]]'''
| |
| |Subtract 9 times the last digit from the rest.
| |
| |182: 18-(2×9)=0
| |
| |-
| |
| |Form the alternating sum of blocks of three from right to left.
| |
| |5,274,997: 5 - 274 + 997 = 728
| |
| |-
| |
| |'''[[99 (number)|99]]'''
| |
| |Add the digits in blocks of two from right to left.
| |
| |144,837: 14 + 48 + 37 = 99.
| |
| |-
| |
| |'''[[100 (number)|100]]'''
| |
| |Ends with at least two zeros.
| |
| |900 ends with 2 zeros
| |
| |-
| |
| |'''[[101 (number)|101]]'''
| |
| |Form the alternating sum of blocks of two from right to left.
| |
| |40,299: 4 - 2 + 99 = 101.
| |
| |-
| |
| |'''[[111 (number)|111]]'''
| |
| |Add the digits in blocks of three from right to left.
| |
| |1,370,184: 1 + 370 + 184 = 555
| |
| |-
| |
| |'''[[125 (number)|125]]'''
| |
| |The number formed by the last three digits must be divisible by 125.<ref name="last-m-digits"/>
| |
| |2125 is divisible by 125.
| |
| |-
| |
| |'''[[128 (number)|128]]'''
| |
| |The number formed by the last seven digits must be divisible by 128.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| |11,280,000 is divisible by 128.
| |
| |-
| |
| |'''[[143 (number)|143]]'''
| |
| |Form the alternating sum of blocks of three from right to left.
| |
| |1,774,487: 1 - 774 + 487 = -286
| |
| |-
| |
| |'''[[256 (number)|256]]'''
| |
| |The number formed by the last eight digits must be divisible by 256.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| |225,600,000 is divisible by 256.
| |
| |-
| |
| |'''[[333 (number)|333]]'''
| |
| |Add the digits in blocks of three from right to left.
| |
| |410,922: 410 + 922 = 1,332
| |
| |-
| |
| |'''[[512 (number)|512]]'''
| |
| |The number formed by the last nine digits must be divisible by 512.<ref name="Pascal's-criterion"/><ref name="last-m-digits"/>
| |
| |1,512,000,000 is divisible by 512.
| |
| |-
| |
| |'''989'''
| |
| |Add the last three digits to eleven times the rest.
| |
| |21758: 21 × 11 = 231; 758 + 231 = 989
| |
| |-
| |
| |'''[[999 (number)|999]]'''
| |
| |Add the digits in blocks of three from right to left.
| |
| |999,999: 999 + 999 = 1,998
| |
| |-
| |
| |'''[[1000 (number)|1000]]'''
| |
| |Ends with at least three zeros.
| |
| |2000 ends with 3 zeros
| |
| |-
| |
| |}
| |
| | |
| ==Generalized divisibility rule==
| |
| | |
| To test for divisibility by ''D'', where ''D'' ends in 1, 3, 7, or 9, the following method can be used.<ref>Dunkels, Andrejs, "Comments on note 82.53—a generalized test for divisibility", ''[[Mathematical Gazette]]'' 84, March 2000, 79-81.</ref> Find any multiple of ''D'' ending in 9. (If ''D'' ends respectively in 1, 3, 7, or 9, then multiply by 9, 3, 7, or 1.) Then add 1 and divide by 10, denoting the result as ''m''. Then a number ''N'' = 10''t'' + ''q'' is divisible by ''D'' if and only if ''mq + t'' is divisible by ''D''.
| |
| | |
| For example, to determine if 913 = 10×91 + 3 is divisible by 11, find that ''m'' = (11×9+1)÷10 = 10. Then ''mq+t'' = 10×3+91 = 121; this is divisible by 11 (with quotient 11), so 913 is also divisible by 11. As another example, to determine if 689 = 10×68 + 9 is divisible by 53, find that ''m'' = (53×3+1)÷10 = 16. Then ''mq+t'' = 16×9 + 68 = 212, which is divisible by 53 (with quotient 4); so 689 is also divisible by 53.
| |
| | |
| == Proofs ==
| |
| | |
| === Proof using basic algebra ===
| |
| | |
| Many of the simpler rules can be produced using only algebraic manipulation, creating [[binomial]]s and rearranging them. By writing a number as the [[positional notation|sum of each digit times a power of 10]] each digit's power can be manipulated individually.
| |
| | |
| '''Case where all digits are summed'''
| |
| | |
| This method works for divisors that are factors of 10 − 1 = 9.
| |
| | |
| Using 3 as an example, 3 divides 9 = 10 − 1. That means <math>10 \equiv 1 \pmod{3}</math> (see [[modular arithmetic]]). The same for all the higher powers of 10: <math>10^n \equiv 1^n \equiv 1 \pmod{3}</math> They are all [[congruence relation|congruent]] to 1 modulo 3. Since two things that are congruent modulo 3 are either both divisible by 3 or both not, we can interchange values that are congruent modulo 3. So, in a number such as the following, we can replace all the powers of 10 by 1:
| |
| | |
| :<math>100\cdot a + 10\cdot b + 1\cdot c \equiv (1)a + (1)b + (1)c \pmod{3}</math>
| |
| | |
| which is exactly the sum of the digits.
| |
| | |
| '''Case where the alternating sum of digits is used'''
| |
| | |
| This method works for divisors that are factors of 10 + 1 = 11.
| |
| | |
| Using 11 as an example, 11 divides 11 = 10 + 1. That means <math>10 \equiv -1 \pmod{11}</math>. For the higher powers of 10, they are congruent to 1 for even powers and congruent to −1 for odd powers:
| |
| | |
| :<math>10^n \equiv (-1)^n \equiv \begin{cases} 1, & \mbox{if }n\mbox{ is even} \\ -1, & \mbox{if }n\mbox{ is odd} \end{cases} \pmod{11}.</math>
| |
| | |
| Like the previous case, we can substitute powers of 10 with congruent values:
| |
| | |
| :<math>1000\cdot a + 100\cdot b + 10\cdot c + 1\cdot d \equiv (-1)a + (1)b + (-1)c + (1)d \pmod{11}</math>
| |
| | |
| which is also the difference between the sum of digits at odd positions and the sum of digits at even positions.
| |
| | |
| '''Case where only the last digit(s) matter'''
| |
| | |
| This applies to divisors that are a factor of a power of 10. This is because sufficiently high powers of the base are multiples of the divisor, and can be eliminated.
| |
| | |
| For example, in base 10, the factors of 10<sup>1</sup> include 2, 5, and 10. Therefore, divisibility by 2, 5, and 10 only depend on whether the last 1 digit is divisible by those divisors. The factors of 10<sup>2</sup> include 4 and 25, and divisibility by those only depend on the last 2 digits.
| |
| | |
| '''Case where only the last digit(s) are removed'''
| |
| | |
| Most numbers do not divide 9 or 10 evenly, but do divide a higher power of 10<sup>''n''</sup> or 10<sup>''n''</sup> − 1. In this case the number is still written in powers of 10, but not fully expanded.
| |
| | |
| For example, 7 does not divide 9 or 10, but does divide 98, which is close to 100. Thus, proceed from
| |
| | |
| :<math>100 \cdot a + b</math>
| |
| | |
| where in this case a is any integer, and b can range from 0 to 99. Next,
| |
| | |
| :<math>(98+2) \cdot a + b</math>
| |
| | |
| and again expanding
| |
| | |
| :<math>98 \cdot a + 2 \cdot a + b,</math>
| |
| | |
| and after eliminating the known multiple of 7, the result is
| |
| | |
| :<math>2 \cdot a + b,</math>
| |
| | |
| which is the rule "double the number formed by all but the last two digits, then add the last two digits".
| |
| | |
| '''Case where the last digit(s) is multiplied by a factor'''
| |
| | |
| The representation of the number may also be multiplied by any number relatively prime to the divisor without changing its divisibility. After observing that 7 divides 21, we can perform the following:
| |
| | |
| :<math>10 \cdot a + b,</math>
| |
| | |
| after multiplying by 2, this becomes
| |
| | |
| :<math>20 \cdot a + 2 \cdot b,</math>
| |
| | |
| and then
| |
| | |
| :<math>(21 - 1) \cdot a + 2 \cdot b.</math>
| |
| | |
| Eliminating the 21 gives
| |
| | |
| :<math> -1 \cdot a + 2 \cdot b,</math>
| |
| | |
| and multiplying by −1 gives
| |
| | |
| :<math> a - 2 \cdot b.</math>
| |
| | |
| Either of the last two rules may be used, depending on which is easier to perform. They correspond to the rule "subtract twice the last digit from the rest".
| |
| | |
| === Proof using modular arithmetic ===
| |
| | |
| This section will illustrate the basic method; all the rules can be derived following the same procedure. The following requires a basic grounding in [[modular arithmetic]]; for divisibility other than by 2's and 5's the proofs rest on the basic fact that 10 mod ''m'' is invertible if 10 and ''m'' are relatively prime.
| |
| | |
| '''For 2<sup>''n''</sup> or 5<sup>''n''</sup>:'''
| |
| | |
| Only the last ''n'' digits need to be checked.
| |
| | |
| :<math>10^n = 2^n \cdot 5^n \equiv 0 \pmod{2^n \mathrm{\ or\ } 5^n}</math>
| |
| | |
| Representing ''x'' as <math>10^n \cdot y + z,</math>
| |
| | |
| :<math>x = 10^n \cdot y + z \equiv z \pmod{2^n \mathrm{\ or\ } 5^n}</math>
| |
| | |
| and the divisibility of ''x'' is the same as that of ''z''.
| |
| | |
| '''For 7:'''
| |
| | |
| Since 10 × 5 ≡ 10 × (−2) ≡ 1 (mod 7) we can do the following:
| |
| | |
| Representing ''x'' as <math>10 \cdot y + z,</math>
| |
| | |
| :<math>-2x \equiv y -2z \pmod{7},</math>
| |
| | |
| so ''x'' is divisible by 7 if and only if ''y'' − 2''z'' is divisible by 7.
| |
| | |
| == Notes ==
| |
| <references />
| |
| | |
| == References ==
| |
| * {{cite book |last1=Apostol |first1=Tom M. |authorlink1= |last2= |first2= |authorlink2= |title=Introduction to analytic number theory |url= |edition= |series=Undergraduate texts in mathematics |volume=1 |year=1976 |publisher=Springer-Verlag |location= |isbn=978-0-387-90163-3 |id= }}
| |
| * {{cite book |last1=Kisačanin |first1=Branislav |authorlink1= |last2= |first2= |authorlink2= |title=Mathematical problems and proofs: combinatorics, number theory, and geometry |url= |edition= |series= |volume= |year=1998 |publisher=Plenum Press |location= |isbn=978-0-306-45967-2 |id= }}
| |
| * {{cite book |last1=Richmond |first1=Bettina |authorlink1= |last2=Richmond |first2=Thomas |authorlink2= |title=A Discrete Transition to Advanced Mathematics |url= |edition= |series=Pure and Applied Undergraduate Texts |volume=3 |year=2009 |publisher=American Mathematical Soc. |location= |isbn=978-0-8218-4789-3 |id= }}
| |
| | |
| == External links ==
| |
| * [http://www.mathwarehouse.com/arithmetic/numbers/divisibility-rules-and-tests.php Interactive Divisibility Lesson on these rules]
| |
| * [http://www.cut-the-knot.org/blue/divisibility.shtml Divisibility Criteria] at [[cut-the-knot]]
| |
| * [http://www.cut-the-knot.org/Generalization/div11.shtml Divisibility by 9 and 11] at [[cut-the-knot]]
| |
| * [http://www.cut-the-knot.org/Generalization/div11.shtml#div7 Divisibility by 7] at [[cut-the-knot]]
| |
| * [http://www.cut-the-knot.org/Generalization/81.shtml Divisibility by 81] at [[cut-the-knot]]
| |
| * [http://www.apronus.com/math/threediv.htm Divisibility by Three Explained]
| |
| * [http://webspace.ship.edu/msrenault/divisibility/index.htm Stupid Divisibility Tricks] Divisibility rules for 2-100.
| |
| | |
| {{DEFAULTSORT:Divisibility Rule}}
| |
| [[Category:Elementary number theory]]
| |
| [[Category:Division]]
| |
| [[Category:Articles containing proofs]]
| |