{{ appName }}

Problem: For an arbitrary, two alphanumeric operand arithmetic problem, find the letter-to-digit mapping that makes the entered problem true. Note that once a letter has been assigned to a digit (0 - 9) the assignment is unique and one-to-one, and there must be a maximum of 10 unique letters in the problem representing the ten digits.

Solution: This could be solved very laboriously by trial and error or by tediously enumerating all possibilities. But there's a better way! Just enter the desired problem below and click the Solve button to find all solutions.