100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

MTH 231

Discrete Mathematics

Wilkes University 3 credits Mathematics

Course Description

This course introduces foundational concepts from this field that underpin higher mathematics, algorithm analysis, discrete probability, and theoretical computer science: basic set operations, concepts from mathematical and propositional logic, fundamental techniques for formal arguments including proofs, existential vs universal quantifiers, mathematical induction, Cartesian products of sets, equivalence relations, order relations, combinatorics, r-permutations and r-combinations of sets and multisets and the pigeonhole principle, graph theory and basic properties of graphs including paths, cycles, graph isomorshisms, graph colorings, trees, and their algorithmic applications. Pre-Requisites: MTH 111 with grade of 2.0 or better.

Code
MTH 231
Credits
3
Subject
Mathematics

Programs That Include This Course

Get expert help with MTH 231 Discrete Mathematics

Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β€” written from scratch to your course requirements.

Get Help Now

Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles