Overview of Discrete Mathematics

In summary, the conversation is about taking a computer science course on Theory of Computation but needing experience in formal mathematics, specifically Discrete Mathematics. The person asks for recommendations on an overview of discrete math, and one suggestion is the book by Kenneth Rosen.
  • #1
pascal12
15
0
I'm planning on taking a computer science course this fall on Theory of Computation. However, one of the prereqs is "experience in formal mathematics at the level of [course on Discrete Mathematics]." I've done a little bit of discrete math before (The Art of Problem Solving covers some discrete math, right?), but I would like to go over it again before jumping into this course. Any recommendations for an overview of discrete math? Since it is for CS, it doesn't need to be incredibly in-depth.
 
Physics news on Phys.org
  • #2
Hey pascal12 and welcome to the forums.

One common reference book for Discrete Math is the one by Kenneth Rosen. Here is an Amazon link to one version:

https://www.amazon.com/dp/0072899050/?tag=pfamazon01-20

If you are at a university, you should be able to get at least one version of this book from your university library.
 
Last edited by a moderator:

What is discrete mathematics?

Discrete mathematics is a branch of mathematics that deals with discrete structures, meaning objects that can only take on distinct, separate values. It includes topics such as set theory, combinatorics, graph theory, and algorithms.

What are some real-world applications of discrete mathematics?

Discrete mathematics has many practical applications, including computer science, cryptography, data analysis, and operations research. It is also used in fields such as engineering, biology, and economics.

What are the main principles of discrete mathematics?

The main principles of discrete mathematics include the study of discrete structures, the use of logical reasoning and proof techniques, and the application of discrete mathematics in problem-solving and algorithm design.

What is the difference between discrete mathematics and continuous mathematics?

The main difference between discrete mathematics and continuous mathematics is that discrete mathematics deals with objects that can only take on distinct, separate values, while continuous mathematics deals with objects that can take on any value within a given range. This makes discrete mathematics more applicable to computer-based systems and algorithms.

What are some common topics in discrete mathematics?

Some common topics in discrete mathematics include set theory, functions and relations, logic and proofs, combinatorics, graph theory, and algorithms. Other topics may include number theory, cryptography, and game theory.

Similar threads

Intro Math Math Tour: Explore Math Fields & Prepare for Grad School
    • Science and Math Textbooks
Replies
3
Views
957
Discrete Seeking Recommendation on Discrete Mathematics textbook
    • Science and Math Textbooks
Replies
4
Views
2K
Book on how to define ideas rigorously
    • Science and Math Textbooks
Replies
6
Views
996
Other What are some sources of recommendations for Math books?
    • Science and Math Textbooks
Replies
1
Views
1K
Discrete Which Discrete Math Textbook Should I Choose?
    • Science and Math Textbooks
Replies
1
Views
2K
Intro Math Plan to revise my learned math & start learning pure math
    • Science and Math Textbooks
Replies
4
Views
1K
Quantum Reading list recommendation for HEP-ph to HEP-th/math-ph transition
    • Science and Math Textbooks
Replies
0
Views
695
Intro Physics Several Physics Books to Choose From (Wolfson, Knight, Feynman)
    • Science and Math Textbooks
Replies
4
Views
2K
Quantum An alternative route to learn mathematics for physics, the "rigorous way"
    • Science and Math Textbooks
Replies
6
Views
2K
Math Applications of discrete mathematics minus software
    • STEM Career Guidance
Replies
2
Views
1K

Hot Threads

Recent Insights

Back
Top