Lesson Divisibility by 2 rule
Algebra
->
Divisibility and Prime Numbers
-> Lesson Divisibility by 2 rule
Log On
Algebra: Divisibility and Prime Numbers
Section
Solvers
Solvers
Lessons
Lessons
Answers archive
Answers
Source code of 'Divisibility by 2 rule'
This Lesson (Divisibility by 2 rule)
was created by by
ikleyn(53977)
:
View Source
,
Show
About ikleyn
:
<H2>Divisibility by 2 rule</H2> The <B><U>"Divisibility by 2" rule</U></B> is as follows: <BLOCKQUOTE><TABLE BORDER=2> <TR> <TD> An integer number is divisible by <B>2</B> if and only if its last digit is divisible by <B>2</B>. </TD> </TR> </TABLE></BLOCKQUOTE> In other words, for checking if the given integer number is divisible by <B>2</B>, make the following steps: 1. Take the last digit of the number while ignoring the rest. 2. Check if this last digit is divisible by <B>2</B>. 3. If the last digit is divisible by <B>2</B>, then the original number is divisible by <B>2</B>. If the last digit is not divisible by <B>2</B>, then the original number is not divisible by <B>2</B>. Quite simple, isn't? <H3>Example 1</H3>Check if the number 358 is divisible by <B>2</B>. <B>Solution</B> The last digit of this number is 8. It is divisible by <B>2</B>. Hence, the original number 358 is divisible by <B>2</B>, in accordance with the <B>"Divisibility by 2" rule</B>. You may check it by making the direct division: {{{358/2}}} = {{{179}}}. It shows that the number 358 is divisible by <B>2</B>. The <B>Divisibility rule</B> allows you to get the same conclusion without making long calculations. <H3>Example 2</H3>Check if the number 371 is divisible by <B>2</B>. <B>Solution</B> The last digit of this number is 1. It is not divisible by <B>2</B>. Hence, the original number 371 is not divisible by <B>2</B>, in accordance with the <B>"Divisibility by 2" rule</B>. For those who loves the proofs, here it is :) <H3>The proof of the "divisibility by 2" rule</H3> First, let us consider how the "divisibility by 2" rule can be proved for the concrete number 358, for example. We can write 358 = 3*100 + 5*10 + 8. The first two additives, 3*100 and 5*10, have the common multiple 10, which is divisible by 2. Hence, the sum of these additives 3*100 + 5*10 is divisible by 2. Therefore, the divisibility by 2 of our original number depends on and is determined solely by the last additive, which is the last digit of the number, i.e. 8 in our case. For the general case, the proof follows the same arguments. Let {{{a[n]}}}{{{a[n-1]}}} . . . {{{a[2]}}}{{{a[1]}}}{{{a[0]}}} be the decimal record of our integer number <B>N</B>. Then <B>N</B> = {{{a[n]*10^n}}} + {{{a[n-1]*10^(n-1)}}} + . . . + {{{10^2*a[2]}}} + {{{10*a[1]}}} + {{{a[0]}}}. The first <B>n</B> additives, {{{a[n]*10^n}}}, {{{a[n-1]*10^(n-1)}}}, . . . , {{{10^2*a[2]}}} and {{{10*a[1]}}} have the common multiple 10, which is divisible by <B>2</B>. Hence, the sum of these additives {{{a[n]*10^n}}} + {{{a[n-1]*10^(n-1)}}} + . . . + {{{10^2*a[2]}}} + {{{10*a[1]}}} is divisible by <B>2</B>. Therefore, the divisibility by <B>2</B> of our original number depends on and is determined solely by the last additive, which is presented by the last digit of the number. It is what has to be proved. <H2>OVERVIEW of Divisibility rules by 2, 3, 4, 5, 6, 9, 10 and 11</H2> The rules for divisibility by 2, 3, 4, 5, 6, 9, 10, and 11 are <BLOCKQUOTE><TABLE BORDER=2> <TR> <TD> An integer number is divisible by <B>2</B> if and only if its last digit is divisible by <B>2</B>. An integer number is divisible by <B>3</B> if and only if the sum of its digits is divisible by <B>3</B>. An integer number is divisible by <B>4</B> if and only if the number formed by its two last digits is divisible by <B>4</B>. An integer number is divisible by <B>5</B> if and only if its last digit is <B>5</B> or <B>0</B>. An integer number is divisible by <B>6</B> if and only if its last digit is even and the sum of the digits is divisible by <B>3</B>. An integer number is divisible by <B>9</B> if and only if the sum of its digits is divisible by <B>9</B>. An integer number is divisible by <B>10</B> if and only if its last digit is <B>0</B>. An integer number is divisible by <B>11</B> if and only if the alternate sum of its digits is divisible by <B>11</B>. </TD> </TR> </TABLE></BLOCKQUOTE> (The <B>alternate sum</B> is the algebraic sum of digits where the sign is changed to the opposite from each digit to the next one). My other lessons in this site on divisibility numbers are - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-3-rule.lesson>Divisibility by 3 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-4-rule.lesson>Divisibility by 4 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-5-rule.lesson>Divisibility by 5 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-6-rule.lesson>Divisibility by 6 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-9-rule.lesson>Divisibility by 9 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-10-rule.lesson>Divisibility by 10 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Divisibility-by-11-rule.lesson>Divisibility by 11 rule</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Restore-the-omitted-digit-in-a-number-in-a-way-the-number-is-divisible-by-9.lesson>Restore the omitted digit in a number in a way that the number is divisible by 9</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Restore-the-omitted-digit-in-a-number-in-a-way-the-number-is-divisible-by-11.lesson>Restore the omitted digit in a number in a way that the number is divisible by 11</A> - <A HREF=https://www.algebra.com/algebra/homework/divisibility/lessons/Can-there-be-a-perfect-square.lesson>Can there be a perfect square ?</A> - <A HREF=https://www.algebra.com/algebra/homework/divisibility/lessons/Math-circle-level-problems-on-divisibility-numbers.lesson>Math circle level problems on divisibility numbers</A> - <A HREF=https://www.algebra.com/algebra/homework/divisibility/lessons/Math-circle-level-problem-on-restoring-digit-in-the-product-of-two-16-digit-numbers.lesson>Math circle level problem on restoring digit in the product of two 16-digit numbers</A> - <A HREF=https://www.algebra.com/algebra/homework/divisibility/lessons/Math-circle-level-problem-on-finding-remainders.lesson>Math circle level problem on finding remainders</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/OVERVIEW-of-Divisibility-rules-by-2-3-4-5-6-9-10-11.lesson>OVERVIEW of Divisibility rules by 2, 3, 4, 5, 6, 9, 10 and 11</A> Lessons that are closely adjacent to these are - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Product-of-two-consecutive-integers-is-divisible-by-2.lesson>Product of two consecutive integers is divisible by 2</A> - <A HREF=http://www.algebra.com/algebra/homework/divisibility/lessons/Product-of-three-consecutive-integers-is-divisible-by-6.lesson>Product of three consecutive integers is divisible by 6</A> - <A HREF=http://www.algebra.com/algebra/homework/Problems-with-consecutive-odd-even-integers/Problems-dealing-with-the-product-of-two-consecutive-integers.lesson>Problems dealing with the product of two consecutive integers</A> - <A HREF=http://www.algebra.com/algebra/homework/Problems-with-consecutive-odd-even-integers/Problems-dealing-with-the-product-of-three-consecutive-integers.lesson>Problems dealing with the product of three consecutive integers</A> When you learn the listed lessons on divisibility rules, you will be able to formulate and to establish many other simple and useful divisibility rules like these: <BLOCKQUOTE><TABLE BORDER=2> <TR> <TD> An integer number is divisible by <B>8</B> if and only if the number formed by its three last digits is divisible by <B>8</B>. An integer number is divisible by <B>15</B> if and only its last digit is 5 or 0 and the sum of its digits is divisible by <B>3</B>. An integer number is divisible by <B>20</B> if and only if its two last digits are 20, 40, 60, 80 or 00. An integer number is divisible by <B>25</B> if and only if its two last digits are 25, 50, 75 or 00. An integer number is divisible by <B>50</B> if and only if its two last digits are 50 or 00. </TD> </TR> </TABLE></BLOCKQUOTE>