In this alphametic equation, each of the small letters in bold denotes a different base b digit from 0 to b-1. 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

the code I used by Charlie)

That's very similar to the code I used, but my method of keeping the digits unique was not as sophisticated, so I'll have to keep this in mind for future use. And I only checked bases up to 15; I don't think my computer and/or algorithm is fast enough to get all the way up to 100!