A Beginner's Guide to Discrete Mathematics Paperback - 2002 - 1st Edition

From the publisher

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. the Bonomial 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. solutions are provided. At the end of each section there is a problem set, with solutions to odd-numbered exercises. There is also a full index. college algebra being the most helpful. However, students with greater mathematical preparation will benefit from some of the more challenging sections.