by Animala » Thu Feb 07, 2008 6:30 pm
Okay, I'll give this a shot.
MATH BACKGROUND INFORMATION:
A little bit of knowledge of modular arithmetic will make this a lot easier to explain. Think of the way a clock works. You have 24 hours in a day, but we count from 1-12 instead. 13 hours is 1 o'clock again. So if you have a number larger than 12, you subtract 12 until you get a number smaller than 12.
Modular arithmetic works similarly, but you can choose any base.
For example, we'll start with the modular base 3, which is how the 1 modifier puzzles work.
There are only three numbers that have any meaning in modular base 3. 0, 1, and 2. if you count mod base 3, you would count 0, 1, 2, 0, 1, 2.
To find out what a number is mod base 3, you subtract 3 until you have a number less than 3 (or divide by 3 and find the remainder, it's the same thing)
So:
0+0 = 0
0+1 = 1
0+2 = 2
1+1 = 2
1+2 = 0 (3 divided by 3 has a remainder of 0)
2+2 = 1 (4 divided by 3 has a remainder of 1)
Each of the symbols represents a number mod base 3. When you modify the key, you add, digit by digit, in base 3. No carrying 1s or anything. This means that V modified by C will always be the same as C modified by V because
V+C = C+V.
The first step is to find out what symbol represents 0. To do this, keep plugging in modifiers until you find a symbol that doesn't change the symbol above it at all. In the 1Modifier example you gave, C represents 0. You can tell because of the first digit. C + V = V. So C is zero.
Here's the wacky part. Pick another symbol. Declare it to be 1 (trust me, this works no matter which symbol you pick). Then work out what the other numbers are based on this. The simplest way to do this is to pick a symbol you have in both the key and the modifiers, so that you can do 1+1 to find out what 2 is. (although this is really easy for 1Modifier problems, since you only have three symbols)
For 2Modifier problems, it's mod base 5. So the numbers are 0, 1, 2, 3, 4.
You follow the same method, using modifiers so that you double up on a symbol in a column. (i.e. V+V+C) If the result is C, then you know V is 0. And you can proceed as before: pick a symbol to be 1, and add 1+0+1 to get the symbol that represents 2.
Once you have the symbols all mapped to numbers, you should be able to predict what the result of any combination of modifiers should be. Unfortunately, you still have to work by process of elimination to find the combination that will give you the answer (or if there's a better method, I haven't found it).