Problem: Queer Multiplication

If I multiply $51,249,876$ by $3$ (thus using all the nine digits once, and once only), I get $153,749,628$ (which again contains all the nine digits once). Similarly, if I multiply $16,583,742$ by $9,$ the result is $149,253,678,$ wherein each case all the nine digits are used. Now, take $6$ as your multiplier and try to arrange the remaining eight digits so as to produce by multiplication a number containing all nine once, and once only. You will find it far from easy, but it can be done.

Solutions: 1


Thank you to the contributors under CC BY-SA 4.0!

Github:
bookofproofs
non-Github:
@H-Dudeney


References

Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

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.