Discrete mathematics difficulty

<p>How does DM compare with Calculus in difficulty? From what I heard, it's much more difficult than Calculus.</p>

<p>I thought Discrete Math was easier and more interesting than Calculus. There are bound to be people who feel otherwise, though.</p>

<p>The term “discrete math” can refer to an exceptionally wide range of distinct subjects, which really span the spectrum in terms of difficulty. Of course, the same is true - though, IMHO, to a lesser extent - of “calculus”. Reasonable people may assign shades of meaning to these terms and arrive at different conclusions about the relative difficulty.</p>

<p>Given that, it seems like the best way to make a fair comparison is to define your terms much more narrowly, and then look for data. Do you have courses - MATH 1200 Calculus for Poets and MATH 8900 Discrete Mathematics, Doctoral Seminar - in mind? Or books - Advanced Calculus VII: Complex Integrals on Algebraic Manifolds and Discrete Mathematics for Dummies? Nail down your terms, and then we can talk about how to find the data you need to answer your question.</p>

<p>I will say that, in general, “discrete mathematics” as a course studied at the undergraduate level in universities isn’t necessarily difficult, per se, but it is far more specialized than Calculus. Give a random student on campus a Calculus exam, and a fair number will probably pass. Give a random student on campus a Discrete Math final exam, and you’ll probably see mostly Math, CS and similar majors passing, and not many others.</p>

<p>Intro disrete math classes are not hard if you’re good at abstract thinking and algebra.</p>

<p>I would say it is easier than calc 2,3 but harder than calc 1</p>

<p>Keep in mind, the Discrete Math courses at the 200/sophomore level may not be as hard as Calculus I or II but the 400/senior level Combinatorics or Graph Theory courses are. In many cases, one needs Calculus II as a pre-req for advanced Combinatorics courses, especially when that course deals with generating functions and whatnot.</p>

<p>I can’t integrate or differentiate to save my life and had zero problem with two discrete math classes (or probability and stats in general)…</p>

<p>It’s one of these “either you get it…” type classes.</p>

<p>My undergraduate probability class required differential and integral calculus on the assignments and exams.</p>

<p>It’s more intuitive and simple, because there are groups and discrete entities. E.g. if you’ve had something like epsilon-delta proofs in calculus, then discrete math is nothing like that (i.e. nothing to do with the intricacies of continuity, because there’s no continuity).</p>

<p>Actually discrete math helped me understand epsilon-delta proofs.</p>

<p>Fine, unless that’s somehow related to how close discrete math comes to (care I say intuitive or “natural”) logic, because first-order logic as well as many intuitive and physical real-world things are surely about groups/sets of things and discrete entities, whereas something like an epsilon-delta proof for continuity is quite an advanced logical statement or “axiomatic requirement” to be honest.</p>

<p>^ Depending on what you mean by “discrete math”, you may include propositional, predicate or higher-order logics; primitive recursive and recursive functions; arithmetic; etc.</p>

<p>Proofs, in particular, are discrete mathematical entities. Constructing a delta-epsilon proof is as much an exercise in discrete mathematics as it is in calculus, indeed, it is fundamentally a problem of discrete mathematics.</p>

<p>Not to mention, I’m not sure what to make of so-called “intricacies” surrounding continuity. Continuity is a simplifying assumption, or assumption by fiat, used precisely for the purpose of making everything easier by avoiding at all costs needing to treat every problem of analysis as a problem of discrete mathematics.</p>

<p>What most CS majors and the like encounter in a first Discrete Math is nowhere near the level of difficulty that would involve calculus type proofs etc. It is usually enumeration type probability type problems not far removed from high school (x of y etc), permutations and combinations, some set theory that might involve basic proofs, relations, etc and the usual graph theory stuff, and some recurrent relations, etc. The latter may involve some proofs also but nothing heavy duty. </p>

<p>Now, if you’re at a theory happy place I’m sure things could get dicier., that has been my experience a long time ago, things may have changed obviously. At Cajun State we had the above plus one operations research class which went more into your linear programming, optimization, more graphs, some decision analysis type math, and the like. Plus a junior level Applied Stats class or two.</p>

<p>@aegrisomnia
“Not to mention, I’m not sure what to make of so-called “intricacies” surrounding continuity. Continuity is a simplifying assumption, or assumption by fiat, used precisely for the purpose of making everything easier by avoiding at all costs needing to treat every problem of analysis as a problem of discrete mathematics.”</p>

<p>The “problem” is in the word ‘assumption’. And the need to axiomatize (without a deep notion about the axiom’s correctness or universality) for provability. It’s a philosophical/philosophy of mathematics question.</p>

<p>And why it may be that something closer to logic, like discrete math, may open one to see better what “higher level” maths do, is logical in the sense that higher math “should be” logical as well.</p>

<p>I have had little to no trouble with discrete mathematics or calculus. However, I also put in some hard work to earn the grades I have in both of these classes. There is no such thing as a “you get it or you don’t” class. Every class requires practice, with a sufficient amount of practice you will learn the material. </p>

<p>It is not necessary that you are a “math wiz” or a genius to understand these concepts. It only requires completing your assignments and preparing for the exams. You should seek help from the math department and look over supplemental material if you are struggling with some concept.</p>

<p>discrete mathematics is usually: Combinatorics, graph theory, binomial theorem and pascals triangle, predicate calculus, set theory, and lastly using relations to define functions; none of it is very difficult and in fact, the predicate calculus will probably help you with proofs of regular calculus </p>

Sup guys I’m a senior in high school and I’m ok at math: Bs in Calc AB. I was planning on going to school to study mechanical engineering but then I realized I really dislike physics. So then I changed my mind to Industrial Engineering which is more systems and business oriented. My question is are there any cs areas of study that aren’t crazy math intensive and require little to no physics? If there are please tell me and also would it be wise to start learning coding now and how would I go about that? Thanks.