000			a
999			_c30377 _d30377
008			211116b xxu||||| |||| 00| 0 eng d
020			_a9781498735865
082			_a004.0151 _bBAU
100			_aBauer, Craig P.
245			_aDiscrete encounters
260			_bCRC Press, _c2020 _aBoca Raton :
300			_axiii, 702 p. ; _bill., _c27 cm
365			_b115.00 _cGBP _d107.10
504			_aIncludes bibliographical references and index.
520			_aEschewing the often standard dry and static writing style of traditional textbooks, Discrete Encounters provides a refreshing approach to discrete mathematics. The author blends traditional course topics and applications with historical context, pop culture references, and open problems. This book focuses on the historical development of the subject and provides fascinating details of the people behind the mathematics, along with their motivations, deepening readers’ appreciation of mathematics. This unique book covers many of the same topics found in traditional textbooks, but does so in an alternative, entertaining style that better captures readers’ attention. In addition to standard discrete mathematics material, the author shows the interplay between the discrete and the continuous and includes high-interest topics such as fractals, chaos theory, cellular automata, money-saving financial mathematics, and much more. Not only will readers gain a greater understanding of mathematics and its culture, they will also be encouraged to further explore the subject. Long lists of references at the end of each chapter make this easy. Highlights: Features fascinating historical context to motivate readers Text includes numerous pop culture references throughout to provide a more engaging reading experience Its unique topic structure presents a fresh approach The text’s narrative style is that of a popular book, not a dry textbook Includes the work of many living mathematicians Its multidisciplinary approach makes it ideal for liberal arts mathematics classes, leisure reading, or as a reference for professors looking to supplement traditional courses Contains many open problems
650			_aComputer science, Mathematics
650			_aDiscrete mathematics
650			_aPascal's triangle
650			_a Bell numbers
650			_a Ulam's Conjecture
650			_a Data compression
650			_a De Moivre's theorem
650			_a De Morgan's law
650			_aDirichlet pigeon-hole principle
650			_aDistributive laws
650			_a Fibonacci numbers
650			_a Four colour map theorem
650			_aThe Game of Life
650			_aGlider
650			_a Icosian game
650			_aVenn diagrams
650			_a Inclusion-exclusion principle
650			_a Loans, mortgages
650			_aMandelbrot set
650			_aNewton's method
650			_a Pascal's triangle
650			_aPerfect matching problem
650			_aMonty Hall Problem
650			_a Real-World Graphs
650			_a Reve's puzzle
650			_a Tessellation structure
650			_a Triangular numbers
650			_aZeckendorf's theorem
942			_2ddc _cBK