Largest Product of Pandigital Factors

Theorem

The largest integer that can be obtained by multiplying $2$ integers which between them use all the digits from $1$ to $9$ is:

$843 \, 973 \, 902 = 9642 \times 87531$


Proof


This theorem requires a proof.
In particular: probably quite simple
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{ProofWanted}} from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.


Sources

  • 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $9642$
  • 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $9642$
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.