This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MATH 127: Final Exam Review Friday, April 29, 2011 Proof Techniques/Topics Direct Algebraic Proofs  Equalities/Inequalities Double Containment Proofs Proof by cases (exhaustion) Proof by contrapositive Proof by contradiction Counterexamples Induction/Strong Induction Bijections/Injections/Surjections Cardinality and Diagonalization Proofs Counting 2 ways Divisibility/GCDs Fundamental Theorem of Arithmetic Equivalence Relations Modular Arithmetic Fermats Little Theorem Wilsons Theorem Pigeonhole Principle Principle of Inclusion/Exclusion Short Answer/Computations Translating sentences/negating sentences Countable/Uncountable sets Combinations Permutations  definition/cycle notation/even and odd/disjoint cycles Euclidean Algorithm Diophantine Equations Linear Congruences/Inverses Chinese Remainder Theorem Conditional Probability Bayes Theorem Multinomial Coefficients...
View
Full
Document
This note was uploaded on 09/08/2011 for the course MATH 21127 taught by Professor Gheorghiciuc during the Spring '07 term at Carnegie Mellon.
 Spring '07
 GHEORGHICIUC
 Math, Algebra, Inequalities

Click to edit the document details