Informational Site NetworkInformational Site Network
Privacy
 
Home Top Rated Puzzles Most Viewed Puzzles All Puzzle Questions Random Puzzle Question Search


THE MYSTIC ELEVEN.

(Money Puzzles)
Can you find the largest possible number containing any nine of the ten
digits (calling nought 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.


Answer:

Most people know that if the sum of the digits in the odd places of any
number is the same as the sum of the digits in the even places, then the
number is divisible by 11 without remainder. Thus in 896743012 the odd
digits, 20468, add up 20, and the even digits, 1379, also add up 20.
Therefore the number may be divided by 11. But few seem to know that if
the difference between the sum of the odd and the even digits is 11, or
a multiple of 11, the rule equally applies. This law enables us to find,
with a very little trial, that the smallest number containing nine of
the ten digits (calling nought a digit) that is divisible by 11 is
102,347,586, and the highest number possible, 987,652,413.










Random Questions

The English Tour
MISCELLANEOUS PUZZLES
The Keg Of Wine.
Measuring, Weight, and Packing Puzzles.
The Dorcas Society
MISCELLANEOUS PUZZLES
Queer Chess.
The Guarded Chessboard
Ancient Chinese Puzzle.
The Guarded Chessboard
The Perplexed Cellarman
MISCELLANEOUS PUZZLES
The Fifteen Orchards
MISCELLANEOUS PUZZLES
The Dissected Triangle.
Various Dissection Puzzles
The Abbot's Puzzle.
Money Puzzles
The Five Dogs Puzzle.
Chessboard Problems
The Board In Compartments.
The Guarded Chessboard
The Riddle Of The Tiled Hearth
THE MERRY MONKS OF RIDDLEWELL
The Frogs Who Would A-wooing Go
MISCELLANEOUS PUZZLES
The Nine Treasure Boxes.
Money Puzzles
The Thirty-six Letter-blocks.
Chessboard Problems