Answer to April 9, 2001 Problem

The 45678 Problem
The answer to the problem is 45678. You arrive at this by subtracting one number from another. The two numbers must contain the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. You must use each of these digits once, but only once.
What two numbers do you subtract to arrive at this answer?


Solution:

There are 24 solutions: 

 
48,615  -  02,937  =  45,678
48,651  -  02,973  =  45,678
57,984  -  12,306  =  45,678
58,047  -  12,369  =  45,678
58,074  -  12,396  =  45,678
59,406  -  13,728  =  45,678
59,460  -  13,782  =  45,678
63,582  -  17,904  =  45,678
65,382  -  19,704  =  45,678
69,783  -  24,105  =  45,678
70,359  -  24,681  =  45,678
70,539  -  24,861  =  45,678
75,138  -  29,460  =  45,678
75,318  -  29,640  =  45,678
75,894  -  30,216  =  45,678
80,295  -  34,617  =  45,678
82,095  -  36,417  =  45,678
86,217  -  40,539  =  45,678
86,271  -  40,593  =  45,678
87,603  -  41,925  =  45,678
87,630  -  41,952  =  45,678
87,693  -  42,015  =  45,678
97,026  -  51,348  =  45,678
97,062  -  51,384  =  45,678
Click here to see Richard Johnson's computer program
Click here to see Chip Schweikarth's computer program

Correctly solved by:

1. Richard Johnson * La Jolla, California
2. Rick Jones Kennett Square, Pennsylvania
3. Bill Hall Wellington, Florida
4. Chip Schweikarth * Winchester, Virginia
5. David Powell * Winchester, Virginia
6. Bob Hearn Winchester, Virginia
7. George Gaither * Winchester, Virginia
8. Greg Harris Winchester, Virginia
9. Walt Arrison Philadelphia, Pennsylvania
10. Erin McGinnis Winchester, Virginia
* Wrote computer programs in C++ to solve the problem