This tweet caught my interest:
It's not too hard to prove this is true. Let's begin by writingWhat's interesting is to extend this idea to other patterns, let's say . Investigating this we find that: It's apparent that every number of the form is thus divisible by 1001. However, 1001 is factorisable: Thus every number of the form is divisible by 7, 11 and 13.
Let's try another one: . This gives: Clearly numbers of this form are divisible by 11. The same is true (pretty obviously) of the pattern aabb where we have: How does this tie in then with the divisibility rule for 11? Well one rule is:
If the difference of the sum of alternative digits of a number is divisible by 11, then that number is divisible by 11 completely.
Let's apply this rule to , and which patterns we know are divisible by 11:
--> --> -->
Thus the divisibility rules are in conformity with what we already knew.
There is an inherent ambiguity in presenting numbers in the form of , , , etc. because algebraically these numbers would be rendered , , and respectively. This is because, when writing for example, the common interpretation is .
It might be better to use a tuple, and say that it is equivalent to . However, I guess things are clear enough if you explicitly state that each pronumeral represents a digit between 0 and 9 and that place as well as face value needs to be taken into consideration..
The patterns of the pronumerals are reminiscent of rhyming schemes in literature and many have specific names e.g. Balliol rhyme AABB. This topic could obviously be investigated more extensively but I'll leave off there for the moment.
No comments:
Post a Comment