The wide range of examples in the text are meant to augment the "favorite examples" that most instructors have for teaching the topcs in discrete mathematics.

To provide diagnostic help and encouragement, we have included solutions and/or hints to the odd-numbered exercises. These solutions include detailed answers whenever warranted and complete proofs, not just terse outlines of proofs.

Our use of standard terminology and notation makes Applied Discrete Structures a valuable reference book for future courses. Although many advanced books have a short review of elementary topics, they cannot be complete.

The text is divided into lecture-length sections, facilitating the organization of an instructor's presentation.Topics are presented in such a way that students' understanding can be monitored through thought-provoking exercises. The exercises require an understanding of the topics and how they are interrelated, not just a familiarity with the key words.

An Instructor's Guide is available to any instructor who uses the text.

Best open source book in Discrete Math. Covers all the subjects in a standard Discrete Math class for mathematics or computer science students and contains sage cells for all subjects. Set Theory, Combinatorics, Logic, Relations, Recursion, Graph Theory, Trees, Algebraic Structures, Boolean Algebras, Automata, etc. Originally published commercially, its original text was peer-reviewed and was adopted for use at several universities throughout the country. Now in its open source version, has the same quality but it is free.

A Cool, Brisk Walk Through Discrete Mathematics, an innovative and non-traditional approach to learning Discrete Math, is available for low cost from Blurb or via free download.

Discrete mathematics is applied in many areas including the physical, engineering, and increasingly, the social sciences. This online textbook, written by mathematics and information technology professors, is aimed at students of information technology, computer science, and applied mathematics. The focus is on applying discrete math techniques from the two broad component areas of discrete math, namely combinatorics or enumerative techniques, and graph theory.

Discrete Mathematics Reading List

MTH 231 ELEMENTS OF DISCRETE MATHEMATICS
Elementary logic and set theory, functions, direct proof techniques, contradiction and contraposition, mathematical induction and recursion, elementary combinatorics, basic graph theory, minimal spanning trees.

Course outcomes: Students who complete MTH 231 will be able to:
1. Apply basic set operations.
2. Negate compound and quantified statements and form contrapositives.
3. Construct a direct proof (from definitions) of simple statements.
4. Apply the principle of mathematical induction.
5. Construct indirect proofs by contraposition and contradiction.
6. Construct explanations for solutions to counting problems.
7. Utilize one or more algorithms for finding a shortest path or a minimal spanning tree in a
connected graph.

KiteModeler was developed in an effort to foster hands-on, inquiry-based learning in science and math. KiteModeler is a simulator that models the design, trimming, and flight of a kite. The program works in three modes: Design Mode, Trim Mode, or Flight Mode. In the Design Mode (shown below), you pick from five basic types of kite designs. You can then change design variables including the length and width of various sections of the kite. You can also select different materials for each component. When you have a design that you like, you switch to the Trim Mode where you set the length of the bridle string and tail and the location of the knot attaching the bridle to the control line. Based on your inputs, the program computes the center of gravity and pressure, the magnitude of the aerodynamic forces and the weight, and determines the stability of your kite. With a stable kite design, you are ready for Flight Mode. In Flight Mode you set the wind speed and the length of control line. The program then computes the sag of the line caused by the weight of the string and the height and distance that your kite would fly. Using all three modes, you can investigate how a kite flies, and the factors that affect its performance.

This course provides an elementary introduction to probability and statistics with applications. Topics include basic combinatorics, random variables, probability distributions, Bayesian inference, hypothesis testing, confidence intervals, and linear regression.
These same course materials, including interactive components (online reading questions and problem checkers) are available on MIT’s Open Learning Library, which is free to use. You have the option to enroll and track your progress, or you can view and use the materials without enrolling.

Word Count: 28360

(Note: This resource's metadata has been created automatically by reformatting and/or combining the information that the author initially provided as part of a bulk import process.)

This supplemental resource provides problems and activities related to Probability and Discrete Mathematics in Middle School.

RocketModeler was developed at the NASA Glenn Research Center in an effort to foster hands-on, inquiry-based learning in science and math. RocketModeler is a simulator that models the design and flight of a model rocket. The program works in two modes: Design Mode or Flight Mode. In the Design Mode, you can change design variables including the size of the rocket body, the fins, and the nose cone. You can also select different materials for each component. You can select from a variety of standard solid rocket engines. The program computes the center of gravity and pressure for your rocket and determines the stability. When you have a design that you like, you can switch to the Flight Mode (shown below), where you can launch your rocket and observe its flight trajectory. You can pause at any time to record data and then continue the flight through parachute deploy and recovery. This program has recently (Oct 8, 2004) been upgraded to support stomp rockets, bottle rockets, and ballistic shells in addition to solid model rockets. It also supports both English and metric units.

This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form. Hands-on exercises help students understand a concept soon after learning it. The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a different perspective or at a higher level of complexity. The goal is to slowly develop students’ problem-solving and writing skills.

In this course, we will present the theory of Probabilistically Checkable Proofs (PCPs), and prove some fundamental consequences of it as well as more recent advances. More specifically, the first half of the course will be devoted to the (algebraic) proof of the basic PCP Theorem and basic relation to approximation problems. We will then move on to more advanced topics, such as hardness amplification, the long-code framework, the Unique-Games Conjecture and its implications, and the 2-to-2 Games Theorem.

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.