Construct an addition alphametic that satisfies all of the following conditions:

1. The problem has a unique solution.
2. Every summand and the sum is the name of a Greek alphabet:ALPHA, BETA,...., OMEGA; and:
3. The total no. of digits in the problem (summands and sum) is as large as possible.

Note: Adapted from JRM 1038 by Frank Rubin.

There are no comments yet.