A Beginner's Guide to Discrete Mathematics

Description

Wallis's book on discrete mathematics is a resource for an introductory course in a subject fundamental to both mathematics and computer science, a course that is expected not only to cover certain specific topics but also to introduce students to important modes of thought specific to each discipline . . . Lower-division undergraduates through graduate students. —Choice (Review of the First Edition) Very appropriately entitled as a 'beginner's guide', this textbook presents itself as the first exposure to discrete mathematics and rigorous proof for the mathematics or computer science student. —Zentralblatt MATH (Review of the First Edition) This second edition of A Beginner’s Guide to Discrete Mathematics presents a detailed guide to discrete mathematics and its relationship to other mathematical subjects including set theory, probability, cryptography, graph theory, and number theory. This textbook has a distinctly applied orientation and explores a variety of applications. Key features of the second edition: * Includes a new chapter on the theory of voting as well as numerous new examples and exercises throughout the book * Introduces functions, vectors, matrices, number systems, scientific notations, and the representation of numbers in computers * Provides examples, which then lead into easy practice problems throughout the text, and full exercises at the end of each chapter * Full solutions for practice problems are provided at the end of the book This text is intended for undergraduates in mathematics and computer science, however, featured special topics and applications may also interest graduate students.

First Sentence

All of discrete mathematics - and, in fact, all of mathematics - rests on the foundations of set theory and numbers.

Excerpt

All of discrete mathematics - and, in fact, all of mathematics - rests on the foundations of set theory and numbers.

Description

This introduction to discrete mathematics is aimed primarily at undergraduates in mathematics and computer science at the freshmen and sophomore levels. The text has a distinctly applied orientation and begins with a survey of number systems and elementary set theory. Included are discussions of scientific notation and the representation of numbers in computers. An introduction to set theory includes mathematical induction, and leads into a discussion of Boolean algebras and circuits. Relations and functions are defined. An introduction to counting, including the Binomial Theorem, is used in studying the basics of probability theory. Graph study is discussed, including Euler and Hamilton cycles and trees. This is a vehicle for some easy proofs, as well as serving as another example of a data structure. Matrices and vectors are then defined. The book concludes with an introduction to cryptography, including the RSA cryptosystem, together with the necessary elementary number theory, such as the Euclidean algorithm. Good examples occur throughout, and most worked examples are followed by easy practice problems for which full solutions are provided. At the end of every section there is a problem set, with solutions to odd-numbered exercises. There is a full index. A math course at the college level is the required background for this text; college algebra would be the most helpful. However, students with greater mathematical preparation will benefit from some of the more challenging sections.

Subjects

Other Editions

• A Beginner's Guide to Discrete MathematicsPaperbackBirkhäuser Boston2002-11-08
• A Beginner's Guide to Discrete MathematicsHardcoverBirkhauser2003-01-01
• A Beginner's Guide to Discrete MathematicsPaperbackSpringer2011-10-07
• A beginner's guide to discrete mathematicsBirkhäuser2012-01-01
• Beginner's Guide to Discrete MathematicsBirkhauser Verlag2013-01-01