Find the number n such that the following alphanumeric equation:
KYOTO
KYOTO
+ KYOTO
TOKYO
has a solution in the base-n number system.
(Each letter in the equation denotes a digit in this system, and different letters denote different digits)
thanks to some computer hackery, n=9, giving the following possible combinations:
y=3 t=4 k=1
y=3 t=7 k=2
y=6 t=5 k=1
y=6 t=8 k=2
if I do some actual thinking there's probably a reason for this...