A Beginner’s Guide to Discrete Mathematics by W. D. Wallis
Contents of Beginner’s Guide to Discrete Mathematics
- Properties of Numbers
- Sets and Data Structures
- Boolean Algebras and Circuits
- Relations and Functions
- The Theory of Counting
- Graph Theory
- Number Theory and Cryptography
Introduction to Beginner’s Guide to Discrete Mathematics
This Introduction to Discrete Mathematics is primarily aimed at undergraduate students in mathematics and computer science at the beginning and secondary levels.
The text has a clear application direction and begins with a survey of number systems and elementary group theory. Discussions about scientific notation and the representation of numbers in computers are included.
An introduction to set theory includes mathematical induction, and leads to a discussion of Boolean algebra and circuits. Relationships and functions are defined.
An introduction to counting, including the binomial theorem, is used in the study of the basics of probability theory. The study of the graph is discussed, including Euler and Hamilton cycles and trees.
This is a means of some easy proofs, as well as being another example of data structure. Then matrices and vectors are defined.
The book concludes with an introduction to cryptography, including the RSA cipher system, along with necessary prime number theory, such as the Euclidean algorithm.
Good examples happen all the time, and most practical examples follow easy practice problems for which complete solutions are provided.
At the end of each section there is a problem set, with solutions to the odd-numbered exercises.
There is a full index. A college-level mathematics course is the required background for this text; Algebra faculty will be very useful. However, students with greater athletic preparation will benefit from some of the more challenging sections.