Discrete mathematics is about precision in reasoning as much as it is about solving problems. Proof techniques like induction, contradiction, and direct reasoning are used to establish results in ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

The recent debate over California’s proposed math framework is missing the forest for the trees. In its myopic focus on which advanced math courses best prepare high school students for their futures, ...

Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations, evaluation of sums, integer functions, elementary number theory, binomial ...

Following a post in the video topic that made me think, what's the most complex/involved math you use regularly enough to stay somewhat proficient in it? Not necessarily pen and paper math, not ...

Whether you like it or not, math will almost always come into business. Whether it’s financial math to figure out how your company is going to fare in the coming quarter, tax math, cost-benefit ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...