What is discrete math

<p>I am taking “discrete mathematics I” next semester through my school’s cs department (for a possible computer science minor) and the description given is:</p>

<p>“Introduces discrete mathematics and proof techniques involving first order predicate logic and induction. Application areas include finite and infinite sets and elementary combinatorial problems. Development of tools and mechanisms for reasoning about discrete problems.”</p>

<p>What does this mean in terms I can understand (anything to make it somewhat clear what this subject which sounds so cool is)? Thanks in advance.</p>

<p>It’s basically all the math that’s not calculus or trig based. So what kind of stuff is that?</p>

<p>Well, graph theory for one. Not graph in the sense of the graph of a function, but as in a bunch of nodes connected by edges. The kind of graph where you try to find paths from one node to another, cycles, etc.</p>

<p>Combinatorics has to do with how many ways something can be done or how many ways in which something can be arranged. Think: combinations, permutations, and factorials.</p>

<p>Number theory has to do with certain basic properties of integers. For instance, an odd number plus an even number yields an odd number. Every number can be written uniquely in a prime factorization form. Think remainder after division, prime factorizations, and properties of integers.</p>

<p>Discrete probability is related to combinatorics and has to do with the relative likelihood of various events occurring.</p>

<p>Logic has to do rigorously proving certain propositions from a few rules of inference. For instance, I can say “A is a B, and all B’s are C’s, so A is a C”. A lot of this is concerned with determining which expressions are tautologies and which are contradictions.</p>

<p>Proofs can be written using several methods… contradiction, cases, induction, etc. Proofs are inherently discrete in that they require a finite number of steps in order to demonstrate the logical validity of a statement. Algorithms are similar to proofs and are also part of discrete mathematics.</p>

<p>Check out Shai Simonson:</p>

<p>[Discrete</a> Mathematics](<a href=“http://aduni.org/courses/discrete/]Discrete”>http://aduni.org/courses/discrete/)</p>

<p>There’s a decent online textbook for discrete at MIT OCW - you just have to find the right course.</p>

<p>UIUC’s description of discrete mathematics:</p>

<p>“Examines discrete mathematical structures frequently encountered in the study of Computer Science. Topics will include sets, propositions, boolean algebra, induction, recursion, relations, functions, and graphs.”</p>

<p>Thanks for the replies. So can this be considered the first “deep” computer science class?</p>

<p>It provides the background material for some of your hardware courses and the “deep” courses. I’d consider Foundations as the first deep CS course. Michael Sipser’s book is pretty common for that. A lot of students hate Foundations as it appears that it has no practical purpose when you take it. It’s hard to relate to anything that you’ve done before too. Most people tend to love it or hate it with most in the hate category. If you love it, then you’re probably more of a theoretical person than a practical hands-on person. Of course there are many people that do both.</p>

<p>

</p>

<p>This will probably be the hardest thing you do proof-wise.</p>

<p>The MIT online textbook for Mathematics for Computer Science is at [MIT</a> OpenCourseWare | Electrical Engineering and Computer Science | 6.042J Mathematics for Computer Science, Fall 2005 | Readings](<a href=“http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-042JFall-2005/Readings/index.htm]MIT”>http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-042JFall-2005/Readings/index.htm)</p>

<p>Are there universities offering distant education credit granting discrete math courses?. This is for my ds. He has completed AP calc BC.</p>

<p>[Current</a> Semester Course Search Details](<a href=“http://continuinged.uml.edu/online/Current_Semsearch_detail.cfm?coursenum=92.321&secnum=-061]Current”>http://continuinged.uml.edu/online/Current_Semsearch_detail.cfm?coursenum=92.321&secnum=-061)</p>