Atnaujinkite slapukų nuostatas

El. knyga: Pearls of Discrete Mathematics

4.40/5 (10 ratings by Goodreads)
(Truman State University, Kirksville, Missouri, USA)
Kitos knygos pagal šią temą:
Pearls of Discrete MathematicsDidesnis paveikslėlis
Kitos knygos pagal šią temą:

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

Methods Used to Solve Discrete Math Problems Interesting examples highlight the interdisciplinary nature of this area

Pearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relationship of these structures to algebra, geometry, number theory, and combinatorics.

Each chapter begins with a mathematical teaser to engage readers and includes a particularly surprising, stunning, elegant, or unusual result. The author covers the upward extension of Pascals triangle, a recurrence relation for powers of Fibonacci numbers, ways to make change for a million dollars, integer triangles, the period of Alcuins sequence, and Rook and Queen paths and the equivalent Nim and Wythoffs Nim games. He also examines the probability of a perfect bridge hand, random tournaments, a Fibonacci-like sequence of composite numbers, Shannons theorems of information theory, higher-dimensional tic-tac-toe, animal achievement and avoidance games, and an algorithm for solving Sudoku puzzles and polycube packing problems. Exercises ranging from easy to challenging are found in each chapter while hints and solutions are provided in an appendix.

With over twenty-five years of teaching experience, the author takes an organic approach that explores concrete problems, introduces theory, and adds generalizations as needed. He delivers an absorbing treatment of the basic principles of discrete mathematics.

Recenzijos

this book will remind you why you think mathematics is fun. the real strengths of this text would be self-study for the motivated student or a source of interesting examples for a more traditional course in various areas of discrete mathematics. The motivated student will learn much new mathematics if they work through this book carefully. For a student curious about exactly which topics make up the field of discrete mathematics, a more cursory trip through this book will do a good job of answering the question. For the library with a collection in recreational mathematics, this book will serve as a nice bridge to the more serious associated areas of mathematics. And finally, for the professional mathematician, using this book as bedtime reading just might remind you of why you found math fun in the first place. Robert A. Beezer, University of Puget Sound, SIAM Review, Vol. 52, Issue 3, 2010

The book will be beneficial to many undergraduates in mathematics. In fact, many sections are within reach of some advanced high school students who would like to explore interesting topics in mathematics. Summing Up: Recommended. CHOICE, April 2010, Vol. 47, No. 08

The book under review is a friendly volume in discrete mathematics, which covers various classical topics, such as counting, probability and number theory, and more recent topics, such as information theory, game theory and algorithms. As far as I know, this book is one of only a few at this level that covers such recent topics. Because it covers algorithms, the book may be interesting for students interested in computer programming. This is essentially a textbook for undergraduates, and perhaps it can be useful for high school students as well. because of the variety of topics, teachers will have many choices of what to cover for students in applied fields. Mehdi Hassani, MAA Reviews, December 2009

I Counting: Basic 1
1 Subsets of a Set
3
2 Pascal's Triangle
5
3 Binomial Coefficient Identities
11
II Counting: Intermediate 19
4 Finding a Polynomial
21
5 The Upward-Extended Pascal's Triangle
25
6 Recurrence Relations and Fibonacci Numbers
27
III Counting: Advanced 37
7 Generating Functions and Making Change
39
8 Integer Triangles
49
9 Rook Paths and Queen Paths
53
IV Discrete Probability 65
10 Probability Spaces and Distributions
67
11 Markov Chains
81
12 Random Tournaments
91
V Number Theory 95
13 Divisibility of Factorials and Binomial Coefficients
97
14 Covering Systems
103
15 Partitions of an Integer
109
VI Information Theory 121
16 What Is Surprise?
123
17 A Coin-Tossing Game
133
18 Shannon's Theorems
139
VII Games 153
19 A Little Graph Theory Background
155
20 The Ramsey Game
165
21 Tic-Tac-Toe and Animal Games
173
VIII Algorithms 181
22 Counters
183
23 Listing Permutations and Combinations
187
24 Sudoku Solving and Polycube Packing
193
A Hints and Solutions to Exercises 201
B Notation 259
Bibliography 261
Index 263
Martin Erickson is a professor of mathematics at Truman State University.
Daugiau apie elektronines knygas Daugiau apie elektronines knygas
Pastovi nuoroda: https://www.kriso.lt/db/97814398161722e.html
Raktažodžiai: