Answers 259general problem, of finding numbers that are the sums of the nth powers of
their digits, see Joseph S. Madachy, Mathematics on Vacation (Scribner's,
1966, pp. 163-165.-M. G.]
- THE SOLITARY SEVEN
The restored simple division sum is as follows:124)12128316(97809
1 1 16
968
868
1003
992
1 1 1 6
1 1 1 6[When Dudeney first published this in The Strand Magazine, a reader,
Harold Revell, of Sussex, sent him a formal proof that the solution is indeed
unique. Mr. Revell sent me a copy of his proof in 1964, but it is too lengthy
to give here.-M. G.]
- A COMPLETE SKELETON
625)631938(1011.1008
625
693
625
688
625
630
625
5000
5000The three D's that must occur at the bottom show that the divisor is a sub-
multiple of 1,000. The factors therefore can only be 5, 5, 5,2,2,2, x, where x