Cheat Sheet Discrete Math

Discrete math cheat sheets actually work if you stop treating them like novels I used to make massive reference sheets before every exam. Six pages of color-coded formulas, examples, proofs, everything. They never helped during the actual test because I'd spend ten minutes just trying to find the right section. What I ended up with was a two-page single-sided sheet organized by problem type rather than topic. That's what I'm describing here.

Cheat Sheet Discrete Math

Start by grouping everything by the question format, not by chapter. When you're sitting there facing an unknown problem, you don't think "this is from the combinatorics chapter." You think "I need to count something" or "I need to prove this by induction" or "this looks like a graph problem." Organize your sheet around those thinking patterns instead.

What actually goes on the sheet

Rule of product. Rule of sum. Permutations with repetition. Combinations. The inclusion-exclusion principle for two and three sets. Binomial theorem with the first three standard applications. Pigeonhole principle stated as both the weak and strong forms because professors love switching between them. These are the bread and butter items you'll see within the first twenty minutes of any midrange discrete math exam. For proofs, put the three main proof techniques in their own section with the exact template for each. Direct proof: assume premises, derive conclusion, cite definitions. Contrapositive: assume not conclusion, derive not premise. Induction: base case, inductive hypothesis, inductive step. Write out the boilerplate language next to each one. You lose more points from sloppy presentation than from actual mathematical errors on my experience. Recurrence relations need their own block. Characteristic equation method for linear homogeneous recurrences with constant coefficients. The three cases: distinct real roots, repeated roots, complex roots. Non-homogeneous part with the method of undetermined coefficients for the standard polynomial and exponential forcing functions. This section alone is worth about twelve to fifteen percent of most exam scores and students routinely leave it blank because they forget which case applies to which recurrence.

Graph theory gets cramped on these sheets so be ruthless. Euler path conditions: exactly zero or two vertices of odd degree. Hamiltonian path: no simple condition exists, just remember Dirac's theorem and Ore's theorem as sufficient but not necessary criteria. Tree properties: n vertices means n minus one edges, connected, no cycles, any two of those three imply the third. Weighted shortest path algorithms, Dijkstra's greedy logic stated in one sentence.

The section nobody thinks about but should

Logic and predicates take up space without giving much back unless you organize them efficiently. Quantifier negation rules using De Morgan's laws for quantifiers. The implication reversal traps: converse, inverse, contrapositive, each labeled clearly with which one is logically equivalent to the original. Existential instantiation and universal generalization rules written as they can copy directly into a proof. Two or three lines here replaces an entire page of confused scrambling during an exam. Set theory identities go in a compact block. Distributive laws. De Morgan's for sets. Double complement. Absorption laws. Write them as equations you can match against a problem statement rather than deriving each time.

A specific problem that broke my system and how I fixed it

Last semester I was building a cheat sheet for a course that included floor and ceiling function identities. I had the basic ones: floor of x plus floor of x plus one half equals floor of two x. Ceiling counterparts. But the exam had a problem asking to simplify floor of n over two plus ceiling of n over two, and I blanked on it for about four minutes because I'd only memorized the individual identities, not the interaction between them. The answer is just n, obviously, but recognizing that required seeing the relationship explicitly. After that I added a subsection specifically for floor-ceiling pair interactions and modular arithmetic identities that show up together. Things like n equals floor of n over k times k plus n mod k. Residue class representatives under addition and multiplication. This addition took maybe three minutes to write and saved me roughly five minutes per occurrence on the actual test, which turned out to be about three occurrences.

Counter-intuitive things that are actually useful

Most people put examples on their cheat sheet. Don't. Examples take up too much room and they don't help you recognize new problems because no two examples look identical under exam pressure. Put a one-line recognition trigger instead. For inclusion-exclusion, write "overcounted unions, subtract pairwise, add triple." For induction, write "show base, assume k, prove k plus one." These triggers are faster to scan and harder to misapply than a worked example you'd have to adapt anyway. Another thing: color-coding helps you find sections faster but uses ink and visual space proportional to its benefit. I switched to bracket notation like [proof] and [counting] and [recurrence] instead. One character prefix, zero extra visual noise, identical find speed once you're familiar with the labels.

When a cheat sheet won't save you

Discrete math exams increasingly include proof-writing questions where the expected answer is a paragraph of structured reasoning, not a formula application. A cheat sheet cannot help you construct a novel proof under time pressure. The best you can do is memorize the structural templates and practice filling them with actual content during study sessions. If your course emphasizes proof construction more than computation, your two-page sheet should reflect that with more template language and fewer formulas. Another failure mode: courses that use open-resource exams where everyone has the same sheet. Professors design these questions specifically to make standard formula lookup useless. They change the parameters just enough that plugging into a memorized formula gives the wrong answer. In those cases, understanding the derivation of each formula matters more than the formula itself. You can't derive Pascal's identity from memory if you've only ever seen it written as an equation without the combinatorial argument behind it.

Physical constraints that matter more than you think

Check your professor's allowed size before you write anything. Some say one page, front and back. Some say one side only. Some ban handwritten sheets entirely and only allow printed material. A sheet that gets confiscated at the door is worse than no sheet at all because you've now spent two to three hours preparing reference material you can't use. Measure your pages in characters per line and lines per page early. A standard letter-size page at ten-point font with one-inch margins holds roughly 350 to 400 words per side if you leave room for quick skimming. Plan your content accordingly. Pen choice affects readability under stress more than people admit. Fine point black gel pens at 0.5 millimeters or 0.7 millimeters. Everything else either bleeds through or fades into the paper texture. Blue ink is harder to read under fluorescent exam hall lighting. Write your section headers in slightly larger font than your body text so you can find things in under three seconds when your heart rate is elevated.

A practical build sequence

Start with a blank page. Write down every formula and rule you know you'll need without worrying about space. Then remove everything that doesn't appear at least twice in past exams or homework sets. Then compress each remaining item to its shortest unambiguous form. Then add recognition triggers for the hard-to-identify problems. Then check the physical size against your professor's rules. Adjust by removing the least frequently used items first. The whole process takes about forty-five minutes to an hour for a standard undergraduate discrete math course. Doing it earlier gives you a second pass where you remove redundant items you thought were essential during the first draft. The second draft is always tighter and usually about twenty percent smaller than the first, which matters when you're fighting for every millimeter on the page. If you want a ready-made version, look for the discrete math reference sheets posted by university math departments. MIT OpenCourseWare and a few other schools publish theirs openly. They're usually well-organized by topic rather than by problem type, so you'd need to reorganize them for exam use, but the content coverage is solid and saves you the initial compile step. Either way, the sheet itself is only useful if you've actually practiced applying the items on it during your study sessions. A cheat sheet without practiced recognition is just paper you carry around for nothing.