[ad_1]
Premise
I used to be taking a look at an issue from the Panini Linguistics Olympiad referred to as “Cistercian Numerals”. It is, because the title suggests, about Cistercian numerals, a code utilized by monks in exile. The medieval cipher was created across the time that Arabic numerals have been launched to Europe.
Here is the hyperlink:https://drive.google.com/file/d/1c0iS21hEgxRZGtVrZvvyePoB7j4t046D/view
The Question
The drawback(for project 1) is to match the given Cisternian numerals to the values offered.
My Atrociously Pathetic Progress
I first tried to imagine that 7 matched to g) (which I later came upon it did), since 7 was the bottom quantity and g) appeared the only(and in addition seemed like a 7, and the issue stated Arabic numerals have been launched round this time). I then matched 13) to j)(incorrect) since j) seemed like g) and 13 was the second smallest. However, these two assumptions didn’t assist me resolve the issue
I then assumed that moreover the center line, every line section represented a digit, together with straight and slanted traces. This would make it base-24. I then tried to make use of Benford’s legislation and the frequencies to match traces to completely different digits, however didn’t succeed.
The Solution
The resolution is offered right here
https://drive.google.com/file/d/1i06r6IrJZRaAqS5ldzDpL7IMJUta7u-J/view
Here can be a key to the digits and sample:
http://davidaking.org/Text%20files/CIPHERS.pdf
To summarize it, solely the highest line segments are for the digits. To multiply by powers of 10, you do completely different rotations and flips. To get a quantity that’s the sum of two identified symbols, you merge the symbols collectively so as to add them.
My Questions
I’ve 2 Questions about this:
-
How would you guess that multiplying by powers of 10 could be equal to completely different rotations and flips of the Cistercian symbols?
-
Even in the event you knew the above, how would you match the road segments to completely different digits?
Thank you.
[ad_2]