If you are picking a team (order doesn't matter), it's a combination ( (nk)the 2 by 1 column matrix; n, k end-matrix;
Use that assumption to prove the statement holds true for If you are picking a team (order doesn't
Combinatorics in 6120A often feels like guesswork. Students struggle to decide whether to use permutations, combinations, or the Pigeonhole Principle. Whether you're taking 6
| Day | In‑class activity | Homework | |-----|------------------------------------------------|----------------------------------------------| | Mon | Simple induction (sum of integers) | Prove sum of squares formula | | Wed | Strong induction (Fibonacci, binary rep) | Prove every n > 1 has prime factor (strong) | | Fri | Recurrence from recursion (factorial, Towers) | Solve T(n) = T(n−1) + n, T(1)=1 by induction| it is an acyclic
Graph theory is a branch of discrete mathematics that deals with graphs, which are collections of nodes and edges.
Whether you're taking 6.120A or preparing for its prerequisite ASE, here is a direct guide to conquering the material:
Learn the strict mathematical definitions of these structures. A tree is not just a hierarchical data structure; it is an acyclic, connected graph. Key Theorem: Master the Handshaking Lemma (