On the Optimizaion of The Number Cipher
Nobody is quite sure why this thing resets every few seconds. It’s probably for health and safety reasons.
This manual assumes you know where the numbered cubes are and what colored lights are active. Please contact VFlyer over on the KTANE Discord for any issues with this manual.
R | G | B | Digits Needed | Instructions | Function |
---|---|---|---|---|---|
A, B, C | Take the digital root of the 3-digit number, or the sum of the 3 digits. | DigitalRoot(A+B+C) | |||
X | A, C | Take the sum of digits A and C. Use the last digit of the sum to submit. | (A+C) % 10 | ||
X | B, C | Subtract B with C, add 10 if the result is less than 0. | (B-C+10)%10 | ||
X | X | B, C | Take the product of digits B and C. Use the last digit of the product to submit. | (B*C) % 10 | |
X | A, B, C | Multiply digits A and B, add C, and then take the digital root of the sum.* | DigitalRoot(A×B+C) | ||
X | X | A, C | Take the product of digits A and C. Use last digit of the product to submit. | (A×C) % 10 | |
X | X | A, B, C | Multiply the digits B and C, add A, and then take the digital root of the sum.* | DigitalRoot(B×C+A) | |
X | X | X | A, B, C | Take the digital root of the product of the 3 digits. | DigitalRoot(A×B×C) |
Green/X represents LIT. A, B, C refers to the first, second, and third digits respectively. % refers to modulo.
*You can take the digital root of the product of the two digits early before adding the remaining digit and taking the digital root of that sum.