In this alphametic equation, each of the small letters in bold denotes a different base b digit from 0 to b1. Neither t nor n can be zero.
(ten)*(ten)  ten = ninety
Determine the minimum value of b, for which there exists at least one solution to the above equation.
(In reply to
re: the code I used by Jim Keneipp)
Mine didn't actually get up to 100 either; when I stopped it, I think it had only gotten to the mid thirties, but it was easier to code 100 initially than to guess what value to use.
Righ now, I'm just letting it run; it's up to 36 now.

Posted by Charlie
on 20091025 14:56:38 