# Problem: The Mystic Eleven

Can you find the largest possible number containing any nine of the ten digits (calling naught a digit) that can be divided by $11$ without a remainder? Can you also find the smallest possible number produced in the same way that is divisible by $11$? Here is an example, where the digit $5$ has been omitted: $896743012.$ This number contains nine of the digits and is divisible by $11,$ but it is neither the largest nor the smallest number that will work.

Solutions: 1

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

Github:

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.