Create a Book
Enter your search terms
Submit search form
Try it FREE or V.I.P.
It's Quick and Easy!
Forgot your password?
is the internet's
online source for free ebook downloads, resources and authors
Amusements in Mathematics
Henry Ernest Dudeney
This is an HTML version of the ebook and may not be properly formatted. Please view the PDF version for the original work.
Click to bookmark this page.
Click to increase font size.
Click to decrease font size.
Click to translate.
Leave a comment.
Add to Library
Add to Library
READ THIS BOOK AS
PDF Format is ideal for: PC's & Macs, iPhone, and Printing
The Text (TXT) format is the simplest format and can be read in any word processor. Plus it is printable.
The ePub format is ideal for the Sony Reader, Barnes & Noble Nook, BeBook, Bookeen, COOL-ER, Hanlin eReader, Hanvon and many other ebook readers
Mobipocket Format is ideal for: Amazon Kindle, Mobile Phones, Blackberry, Palm, IRex, ILiad, Hanlin, BeBook and other mobile devices
Where n = 6 there is 1 fundamental solution and 4 in all.
Where n = 7 there are 6 fundamental solutions and 40 in all.
Where n = 8 there are 12 fundamental solutions and 92 in all.
Where n = 9 there are 46 fundamental solutions.
Where n = 10 there are 92 fundamental solutions.
Where n = 11 there are 341 fundamental solutions.
Obviously n rooks may be placed without attack on an n
board in n! ways, but how
many of these are fundamentally different I have only worked out in the four cases where
n equals 2, 3, 4, and 5. The answers here are respectively 1, 2, 7, and 23. (See No.
The Four Lions
We can place 2n-2 bishops on an n
board in 2
ways. (See No.
.") For boards containing 2, 3, 4, 5, 6, 7, 8 squares, on a side there are
respectively 1, 2, 3, 6, 10, 20, 36 fundamentally different arrangements. Where n is odd
there are 2
such arrangements, each giving 4 by reversals and reflections, and 2
giving 8. Where n is even there are 2
, each giving 4 by reversals and
reflections, and 2
, each giving 8.
We can place ½(n
+1) knights on an n
board without attack, when n is odd, in 1
fundamental way; and ½n
knights on an n
board, when n is even, in 1 fundamental way.
In the first case we place all the knights on the same colour as the central square; in the
second case we place them all on black, or all on white, squares.
THE TWO PIECES PROBLEM.
On a board of n
squares, two queens, two rooks, two bishops, or two knights can always
be placed, irrespective of attack or not, in ½(n
) ways. The following formulæ will
show in how many of these ways the two pieces may be placed with attack and
With Attack. Without Attack.
5n3 - 6n2 + n 3n4 - 10n3 + 9n2 - 2n
n4 - 2n3 + n2
2 Rooks n3 - n2
4n3 - 6n2 + 2n 3n4 - 4n3 + 3n2 - 2n
n4 - 9n2 + 24n
2 Knights 4n2 - 12n + 8