# What Should I Learn Before Discrete Math?

If you are considering taking a course in discrete mathematics or pursuing a career in computer science, you may be wondering what math you should learn before diving into this field. Discrete mathematics is a branch of mathematics that focuses on the study of mathematical structures that are distinct, separate, and countable. It is a fundamental subject in computer science and often serves as a prerequisite for other computer science courses.

## What Math Do I Need to Learn Before Discrete Mathematics?

Students with a solid understanding of algebra, geometry, and precalculus will do very well in discrete math. In addition, it is recommended that students have a strong foundation in combinatorics, logic, and set theory. These branches of mathematics play a significant role in discrete mathematics and can help you better understand and excel in the subject.

Math Skills Needed for Discrete Mathematics | Examples |
---|---|

Algebra | Linear equations, systems of equations, matrices, polynomials, factors, functions, and graphing. |

Geometry | Angles, triangles, circles, polygons, congruence, similarity, and trigonometry. |

Precalculus | Functions, graphs, limits, derivatives, integrals, and the fundamental theorem of calculus. |

Combinatorics | Permutations, combinations, binomial coefficients, pigeonhole principle, and inclusion-exclusion principle. |

Logic | Propositional logic, predicate logic, Boolean algebra, truth tables, and logical deduction. |

Set Theory | Sets, subsets, power sets, operations on sets, relations, functions, and cardinality. |

## FAQ: What Should I Learn Before Discrete Math?

### 1. Can I Take Discrete Mathematics Without Calculus?

Yes, you can take discrete mathematics without calculus. However, many of the concepts covered in discrete mathematics require a strong mathematical foundation. Calculus can provide a deeper understanding of the concepts and improve your problem-solving skills.

### 2. What is the Importance of Combinatorics in Discrete Mathematics?

Combinatorics is the study of counting, arranging, and choosing objects. It is an essential part of discrete mathematics and provides a framework for solving problems related to discrete structures. In discrete mathematics, combinatorics is used in graph theory, coding theory, cryptography, and many other areas.

### 3. Do I Need Programming Experience Before Learning Discrete Mathematics?

No, programming experience is not required to learn discrete mathematics. While discrete mathematics is a foundational subject in computer science, it is often taught independently of programming. However, programming experience can be useful in understanding the applications of discrete mathematics in computer science.

## Resources for Learning Math Before Discrete Mathematics

- Khan Academy’s Algebra Course
- Khan Academy’s Geometry Course
- Khan Academy’s Precalculus Course
- Mathisfun’s Combinatorics Lessons and Examples
- Mathisfun’s Logic Lessons and Examples
- Mathisfun’s Set Theory Lessons and Examples

## Conclusion

To excel in discrete mathematics, it is essential to have a strong foundation in algebra, geometry, precalculus, combinatorics, logic, and set theory. These mathematical skills are not only important for discrete mathematics but also for various other fields such as computer science, cryptography, and graph theory. Thus, spending time mastering these mathematical concepts will pave the way for you to be successful in your academic and professional endeavors.