Solve this alphametic, where each capital letter in bold represents a different decimal digit from 0 to 9. None of the numbers can admit any leading zero.

                                 (NOW)^THE = (OLD)^HAT

(In reply to Supercomputer? by ed bottemiller)

no, I simply used brute force.  I used mathematica and simply ran through all possible permutations with n,o,t, and h only going from 1 to 9 and the rest going from 0 to 9.  I then used the*ln(now)=hat*ln(old) for the comparison to speed things up a bit.  Other than that no real tricks were used to optimize.  It ran in less than 10 minutes.

Posted by Daniel on 2009-02-20 12:36:56