img Leseprobe Leseprobe

The Mathematics of Various Entertaining Subjects

Volume 3: The Magic of Mathematics

Jason Rosenhouse (Hrsg.), Jennifer Beineke (Hrsg.)

PDF
ca. 47,99
Amazon iTunes Thalia.de Weltbild.de Hugendubel Bücher.de ebook.de kobo Osiander Google Books Barnes&Noble bol.com Legimi yourbook.shop
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf reinlesen.de sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt reinlesen.de von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Princeton University Press img Link Publisher

Naturwissenschaften, Medizin, Informatik, Technik / Mathematik

Beschreibung

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.

Weitere Titel von diesem Autor
Weitere Titel zum gleichen Preis
Cover Moduli Spaces
Richard P. Thomas

Kundenbewertungen

Schlagwörter

Computation, Conjecture, Mathematical analysis, Analytic number theory, Enumerative combinatorics, Math circle, Recursion (computer science), Equilateral triangle, Classification theorem, Computational geometry, Computer science, Computational problem, Result, Popular mathematics, Mathematical problem, Fair coin, Applied mathematics, Diagram (category theory), Train track (mathematics), Combinatorial proof, Geometry and topology, Solver, Mathematical optimization, Riemann hypothesis, Arithmetic mean, Lucky number, Inequality (mathematics), Mathematical notation, Latin square, Prime number, Translational symmetry, Landau's function, Cyclic number, Instance (computer science), Kruskal's algorithm, With high probability, Number theory, Significant figures, Open problem, Optimization problem, Decision problem, Crossing number (graph theory), Theorem, Kernel smoother, On Numbers and Games, Coprime integers, Mathematical Association of America, Set (mathematics), Computer scientist, Matching (graph theory), Fermat's little theorem, Algorithm, PSPACE-complete, Binary tree, Coin flipping, Algorithmic, Primitive root modulo n, Discrete mathematics, Mathematical Association, Analysis of algorithms, Mental calculation, Pure mathematics, Steiner point, Dynamic programming, Complex number, Magic square, Mathematical logic, Recreational mathematics, Geometry, Mathematician, Summation, Luhn algorithm, Abstract algebra, Time complexity, Mathematics, Permutation, Potential game, Variable (mathematics), Reversible computing, Scientific notation, Sign (mathematics), Hamming code, Computational complexity theory, Expected value, NP-completeness, Mathematical induction, Mathematical structure, Elementary proof, Calculation, Flexagon, Mathematical proof, Arithmetic, Equiprobability, Friendly number, The College Mathematics Journal, Algebraic geometry, Parity (mathematics), Interval (mathematics), Probability, NP-hardness