Javascript is not enabled in your browser.

- The Social World of Pupil Career: Strategic Biographies Through Primary School.
- My Wishlist.
- Search form.
- Discrete Mathematics: Elementary and Beyond by László Lovász.

Enabling JavaScript in your browser will allow you to experience all the features of our site. Learn how to enable JavaScript on your browser. Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics.

- Discrete Mathematics: Elementary and Beyond | Mathematical Association of America.
- Discrete Mathematics by Laszlo Lovasz, Jozsef Pelikan | Waterstones.
- You may also be interested in...!

It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to help students understand the solutions to problems. Numerous examples, figures, and exercises are spread throughout the book.

### About This Item

See All Customer Reviews. Shop Textbooks. Add to Wishlist.

Primality testing is not new either, but it is not standard fare, and lends a nice flavor here. I was also pleased that in several places the authors would state a best known result, and then proceed to state and prove an easier result — one that was within the scope of the book. Surely there are some readers who will find this sort of bait and switch annoying, but I am not one of them.

In fact, I felt it added to the introductory nature of the text. This book does a wonderful job of communicating mathematics as a vibrant field. In many places the authors are willing to remark on the process of doing mathematics, on questions that appear "natural" or "surprising" and of course "elegant". The first paragraph of the chapter entitled Integers, Divisors, and Primes presents a good example of this philosophy in action:.

## Math 221: Discrete Mathematics

The authors carefully remind us throughout the text that what is convincing does not necessarily constitute a proof. But they do not shy away from first convincing the reader of the likelihood of a result having usually led the reader to that point skillfully and then providing a proof. Lovasz, Pelikan and Vesztergombi's choice of topics does have a more mathematical bent in comparison to some other undergraduate texts at which I looked. The first chapter takes up the topics of sets and counting, but the discussion of unions of sets, intersection of sets, and other such introductory logic is extremely brief.

The second chapter leads to the pigeonhole principle, but also discusses estimating the size of numbers, a theme that reappears from time to time throughout the book.

The binomial theorem is the main tool of the next chapter, leading quite nicely to identities arising from Pascal's triangle and estimates for sums and quotients of binomial coefficients. Recurrence relations are briefly introduced via the Fibonacci numbers, but attention quickly turns to combinatorial probability and a new chapter.

- Elementary and Beyond.
- Discrete Mathematics: Elementary and Beyond.
- True Taste: The Seven Essential Wine Words;
- Discrete Mathematics Elementary Beyond by Lovasz.
- Taste of Home Jams, Jellies, Pickles & More.

In Chapter Six, the theme is prime numbers. This is the longest chapter in the text, at about thirty pages. Graphs and trees, and matching and optimization problems are the themes of the next few chapters.

### Table of Contents

Then there is a foray into planar geometry leading to a discussion of the Four Color Theorem. The last two chapters delve into coding theory and cryptography by introducing projective planes, Steiner systems, etc, on the way to describing the RSA cryptosystem. I'm a sucker for projective planes, as well as cryptography, and was delighted with this selection as a fitting conclusion to the book.

While the choice of topics was to my taste and what made reading this book fun, it will be seen as a drawback by some readers who desire more connection with computer science. For example, there is no mention of boolean logic or automata. Likewise, algorithms are discussed strictly from a mathematical viewpoint — as in the Euclidean Algorithm, as are recurrence relations. To conclude, in Discrete Mathematics Lovasz, Pelikan and Vesztergombi have succeeded in providing us with a book that is sure to please many readers.

## Discrete Mathematics: Elementary and Beyond - PDF Free Download

It is indeed elementary enough to use as a text in class although be warned: the solutions to all the exercises are included. But a reader interested in discrete mathematics mostly for the sake of computer science will likely be disappointed, frustrated, or both. Michele Intermont intermon kzoo.