6120a Discrete Mathematics And Proof For Computer Science Fix Page

Assume the opposite and show it leads to nonsense. 4. Top Resources to "Fix" Your Understanding

You are trying to prove (P → Q) → R by checking when P is true. That’s wrong. Logical implication is not causality; it’s a contract. Assume the opposite and show it leads to nonsense

| Proof Type | Strategy | Typical Mistake | Fix | |------------|----------|----------------|-----| | Direct | Assume P, derive Q | Circular reasoning | Start with given facts, use definitions | | Contrapositive | Prove ¬Q → ¬P | Confusing with contradiction | State contrapositive explicitly | | Contradiction | Assume P ∧ ¬Q, reach impossible | Not reaching a clear contradiction | End with “this contradicts X” | | Induction | Base case + inductive step | Forgetting base case or assuming what you’re proving | Write inductive hypothesis clearly | That’s wrong

Unlike calculus, which deals with continuous change, discrete mathematics focuses on distinct, separated values. This is the native language of computers (0s and 1s). 6120A bridges the gap between abstract math and practical computation. The Core Modules This is the native language of computers (0s and 1s)