Video summary
The video explores the mathematical logic behind the well-known rule that determines whether a number is divisible by 9 based on its digit sum. Using the example of the number 5832, it explains that if the sum of its digits is divisible by 9, then the entire number must also be divisible by 9. To understand why this trick works, the explanation moves from specific examples to a general algebraic proof involving any four-digit number represented as ABCD.
By breaking down the number into its place values, the video expresses it as A times 1000 plus B times 100, C times 10, and D times 1. The core of the argument involves rewriting the powers of ten in a clever way: 1000 becomes 999 plus 1, 100 becomes 99 plus 1, and 10 becomes 9 plus 1. When these substitutions are made into the original equation and the terms are distributed, the expression separates into two distinct parts.
The first part of the resulting equation consists of multiples of 999, 99, and 9, all of which are clearly divisible by 9. This means that regardless of what digits A, B, C, and D represent, this entire section will always be a multiple of 9. The second part of the equation simplifies to just the sum of the individual digits, A plus B plus C plus D. Consequently, the only factor that determines whether the whole number is divisible by 9 is whether this remaining sum of digits is itself divisible by 9.
In conclusion, the divisibility rule for 9 holds true because any integer can be decomposed into a part that is inherently divisible by 9 and a remainder equal to the sum of its digits. Therefore, an integer is divisible by 9 if and only if the sum of its digits is also divisible by 9. This logical deduction confirms that checking the digit sum is not just a convenient shortcut, but a mathematically rigorous test for divisibility by nine.
Read the full video transcript
How can we know if the number
5832
is divisible by 9? We calculate the digit
sum of the number,
and if the digit sum
is divisible by nine,
then the number itself is divisible by nine
.
But why?
Let's solve the general problem.
We can write a number ABC D,
where A represents the place value, B
represents the hundreds place, C represents the tens
place,
and D represents the one place. Just
as we write the number 5832
as 5 x 1000 + 8 * 100 + 3 * 10
+ 2 * 1, we can write the general number
ab cd like this. A* 1000 + b* 100 +
c* 10 + d* 1.
Here is our formula for the number starting from
CD.
d * 1 = D.
Is this divisible by 9? Now comes a
sneaky trick. We write
1000 as 999
+ 1,
100 as 99 + 1, and 10 as 9 + 1. Now
we distribute the multiplication
and change the order of the multiplicands
and also change the order of the sums
. Now we ask again, is this
divisible by nine?
We can write the division in this way
. The first part is divisible by 9
because 999 is divisible by 9,
and the second and third parts are also
divisible by n because 99 and 9
are divisible by 9. So the entire
mathematical expression is divisible by nine
only if a + b + c + d
is also divisible by nine.
And a + b + c + d is the digit sum of
the number from CD onwards, and therefore an
integer is divisible by nine if the
digit sum is also divisible by nine.