# Mathematical Journeys (Wiley-Interscience Publication) by Peter D. Schumer By Peter D. Schumer

Published within the leisure arithmetic email publication, reprinted with permission.

Best puzzles & games books

Mathematical Journeys (Wiley-Interscience Publication)

Arithmetic is greater than only a huge set of difficulties. possibly greater than the other factor, it really is approximately rules, frequently from a seed planted by means of a simple human actual desire, yet mostly, the unique germ seemed within the brain of a human. simple rules make the information of arithmetic diversified from the abstractions in different parts.

Ancient Puzzles: Classic Brainteasers and Other Timeless Mathematical Games of the Last Ten Centuries

Fit wits with the nice minds of the world’s maximum civilizations during this interesting selection of old conundrums, brainteasers, and mind-benders.   • What do prehistoric bone markings and smooth machine technology have in universal? • What is the secret of pi that stumped generations of historic mathematicians?

Additional info for Mathematical Journeys (Wiley-Interscience Publication)

Sample text

5. There the difference between the two piles is b − s − a as required. If 0 ≤ b − s < a, then move to the position where b − s occurs in the table ending up at either (a ∗ , b − s) or (b − s, b ∗ ) for appropriate a ∗ or b ∗ . In case (c), Player 2 moves to position (a − s, b − s) for some s with 1 ≤ s ≤ min{a, b}. 5 and moves accordingly to either (a ∗ , a − s) or (a − s, b ∗ ) for some a ∗ or b ∗ . In all three cases, Player 1 moves to a winning position from which Player 2 is forced to move away.

What if we want to eliminate all the odd-numbered positions ﬁrst? P (4, 5) = 1 2 3 4 . But then we hit a snag. 1 3 4 2 Given n = 6, no value of q will ﬁrst eliminate positions 1, 3, 5 in that precise order. If there were such a value of q, then q ≡ 1 (mod 6) in order to eliminate 30 MATHEMATICAL JOURNEYS person #1 ﬁrst. But now there are 5 people left and beginning at position 1 we wish to eliminate person #3. Since person #2 also remains, it follows that q ≡ 2 (mod 5). Next there are 4 people remaining, we start at position 3, and must eliminate person # 5 stepping over person #4.

R+1 2r + 1 2 r=1 + . But 2 r1+1 + . . + 2 r1+1 ≥ 2 r1+1 + . . + 2 r1+1 (consisting of 2 r identical terms) since each term of the sum on the left is at least as large as the corresponding term of the sum on the right. r 1 1 1 Furthermore, 2 r1+1 + · · · + 2 r1+1 = 2 2r +1 = 12 . Thus, ∞ n=1 n ≥ 1 + 2 + 2 + 1 2 + . . (with an inﬁnite number of one-halves), which certainly increases without bound. Since the harmonic series is even larger, it must diverge as well. There have been many other proofs that the harmonic series diverges.