I learnt of this sublime cryptarithm as a schoolboy, circa 1954. Can anybody identify the original source? ONE+ONE+ONE+THREE+THREE+ELEVEN = TWENTY No initial zeros; distinct letters represent distinct decimal digits; solution unique. Fred Lunnon On 4/13/13, Hans Havermann <gladhobo@teksavvy.com> wrote:
Has this already been done?
Four years ago, I played around with base-16 numbers where the digits 10, 11, 12, 13, 14, 15 were represented by the symbols +, -, *, /, ^, ==. I wondered, for a given-length number, how many of them Mathematica would return as True when the number's string-equivalent was evaluated as an expression. Needless to say, exponentiation proved an insurmountable issue. I also dealt with the matter of whether + and - were to be operations only or could also represent positive and negative. While leading zeros bothered me, more than one equality-sign, not so much. Anyways, to make a long story short, my interest waned as the complexity of the issues dawned on me. _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun