6120a Discrete Mathematics And Proof For Computer Science Fix !!top!! -

When facing a complex logical statement, write out the literal English translation directly beneath it. : Confusing (If P, then Q) with (If Q, then P). The Remedy : Remember that means "P is a sufficient condition for Q," while means "P is a necessary condition for Q." The Quantifier Rule : Never let a quantifier float. Every must be tied to a specific domain (e.g., Fix 2: Standardize Your Proof Templates

Working in isolation is a major mistake. Form a study group of 3-4 people. For each problem set, before turning it in, have a : When facing a complex logical statement, write out

For example, to prove that the following algorithm correctly computes factorial, you would use a loop invariant: Every must be tied to a specific domain (e

Given a ≡ b and b ≡ c (mod n) . Rewrite: a - b = n*k , b - c = n*m . Add: a - c = n(k+m) . Therefore a ≡ c (mod n) . Rewrite: a - b = n*k , b - c = n*m