Solve this alphametic, where each of the capital letters in bold denotes a different decimal digit from 0 to 9. None of the numbers can contain any leading zero.
3√(HOW)+ 3√(AND) = 3√(WHEN)
(In reply to re(3): two views
"Infinite precision" was as I meant.
I understand that, and using a poor example, a computer might generate 3.9999999... to represent 4 and so we need to compensate for that in the programming which is what I was attempting with the string comparisons in my program.
Thanks for the answers, appreciated.
Posted by brianjn
on 2009-07-30 23:24:34