Problem: Digital Division

It is another good puzzle so to arrange the nine digits (the nought excluded) into two groups so that one group, when divided by the other, produces a given number without remainder. For example, $13458$ divided by $6729$ gives $2.$ Can the reader find similar arrangements producing $3,$ $4,$ $5,$ $6,$ $7$, $8,$ and $9$ respectively? Also, can he find the pairs of smallest possible numbers in each case? Thus, $14658$ divided by $7329$ is just as correct for $2$ as the other example we have given, but the numbers are higher.

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.