Working with these problems myself and with others has served to highlight:
(i) an awareness (or lack) of our number system and how it is built up but also,
(ii) a need to function generally whilst working with specifics i.e. proving that all multiples of 11 demonstrate a certain property.
The first of the problems looks at 4 digit palindromes and the fact that they are all divisible by 11, can you show this? An example of a palindrome would be
racecar, hannah, I
What would a numeric palindrome look like?The second of the problems asks why the test for divisibility by 11 works...for those who aren't sure this is as follows:
Add up the even digits, add up the odd digits, find the difference.
If the difference is divisible by 11 so is the original number
e.g. 174757
odd digits --> 1 + 4 + 5 = 10
even digits --> 7 + 7 + 7 = 21
Difference is 11 so our number should be divisible by 11
If the difference is divisible by 11 so is the original number
e.g. 174757
odd digits --> 1 + 4 + 5 = 10
even digits --> 7 + 7 + 7 = 21
Difference is 11 so our number should be divisible by 11
The question remains why does this work? Can you show this in general?
No comments:
Post a Comment