The Mathematics of Various Entertaining Subjects (eBook)

Volume 3: The Magic of Mathematics

Jennifer Beineke, Jason Rosenhouse (Herausgeber)

eBook Download: PDF

2019
352 Seiten
Princeton University Press (Verlag)
978-0-691-19441-7 (ISBN)

Infos

The history of mathematics is replete with examples of major breakthroughs resulting from solutions to recreational problems. The modern theory of probability arose out of problems of concern to gamblers, for example, and modern combinatorics grew out of various games and puzzles. Despite this track record and a wealth of popular-level books, there remain few conduits for research in recreational mathematics. The Mathematics of Various Entertaining Subjects now returns with an all-new third volume, presenting new research in diverse areas of recreational mathematics.This volume focuses on four areas: puzzles and brainteasers, games, algebra and number theory, and geometry and topology. Readers will create Spiral Galaxies, Japanese symmetric grid puzzles consisting of squares and circles whose solutions are letters and numbers; delve into a paradox in the game of Bingo; examine the card tricks of mathematician-philosopher Charles Sanders Peirce; learn about the mathematics behind Legos; and much more.Elucidating the many connections between mathematics and games, The Mathematics of Various Entertaining Subjects is sure to challenge and inspire mathematicians and math enthusiasts.

Autor

Jennifer Beineke is professor of mathematics at Western New England University. Jason Rosenhouse is professor of mathematics at James Madison University. Beineke and Rosenhouse are the coeditors of The Mathematics of Various Entertaining Subjects, Volumes I and II (Princeton).

Produkt-Details

• Erscheint lt. Verlag: 13.8.2019
• Zusatzinfo: 85 color + 71 b/w illus.
• Verlagsort: Princeton
• Sprache: englisch
• Themenwelt: Sachbuch/Ratgeber ► Freizeit / Hobby ► Spielen / Raten
• Themenwelt: Mathematik / Informatik ► Mathematik ► Geschichte der Mathematik
• Schlagworte: abstract algebra • Algebraic Geometry • algorithm • algorithmic • analysis of algorithms • Analytic number theory • Applied mathematics • arithmetic • arithmetic mean • binary tree • Calculation • Classification theorem • Coin flipping • combinatorial proof • complex number • Computation • computational complexity theory • Computational Geometry • Computational problem • Computer Science • Computer Scientist • conjecture • Coprime integers • Crossing number (graph theory) • Cyclic number • Decision problem • Diagram (category theory) • Discrete Mathematics • Dynamic Programming • Elementary proof • Enumerative Combinatorics • equilateral triangle • Equiprobability • expected value • Fair coin • Fermat's Little Theorem • Flexagon • Friendly number • Geometry • Geometry and Topology • Hamming code • Inequality (mathematics) • Instance (computer science) • Interval (mathematics) • Kernel smoother • Kruskal's Algorithm • Landau's function • latin square • lucky number • Luhn algorithm • Magic Square • Matching (graph theory) • Math circle • Mathematical Analysis • Mathematical Association • Mathematical Association of America • Mathematical Induction • Mathematical Logic • Mathematical Notation • Mathematical Optimization • Mathematical problem • Mathematical Proof • mathematical structure • mathematician • Mathematics • Mental calculation • np-completeness • NP-hardness • Number Theory • On Numbers and Games • Open problem • optimization problem • Parity (mathematics) • Permutation • Popular Mathematics • Potential Game • Prime number • Primitive root modulo n • Probability • PSPACE-complete • Pure Mathematics • Recreational Mathematics • Recursion (computer science) • result • reversible computing • Riemann hypothesis • scientific notation • Set (mathematics) • Significant figures • Sign (mathematics) • solver • Steiner point • Summation • The College Mathematics Journal • Theorem • time complexity • Train track (mathematics) • Translational symmetry • Variable (mathematics) • With high probability
• ISBN-10: 0-691-19441-6 / 0691194416
• ISBN-13: 978-0-691-19441-7 / 9780691194417