Here is another entertaining problem with the nine digits, the naught being excluded. Using each figure once, and only once, we can form two multiplication sums that have the same product, and this may be done in many ways. For example, $7\times 658$ and $14\times 329$ contain all the digits once, and the product in each case is the same — $4,606.$ Now, it will be seen that the sum of the digits in the product is $16,$ which is neither the highest nor the lowest sum so obtainable. Can you find the solution to the problem that gives the lowest possible sum of digits in the common product? Also, that which gives the highest possible sum?
Solutions: 1
This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.
