Final Exam - Mathematical Structures | MAT 300, Exams of Mathematics

Material Type: Exam; Class: Mathematical Structures; Subject: Mathematics; University: Arizona State University - Tempe; Term: Spring 2005;

Typology: Exams

Pre 2010

Uploaded on 09/02/2009

koofers-user-sav
koofers-user-sav 🇺🇸

5

(1)

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Mat 300, Spring 2009
Final Exam, 05/12, 9:50-11:40, PSA 113
1. Operations and quantifiers
Operations: conjunction, disjunction, biconditional, conditional.
Propositional equivalence.
Quantifiers: truth values, negations, and translations.
2. Methods of Proof
Direct and indirect proofs of implication.
Proof by contradiction. Irrationality of 2,3.
Proof of a biconditional.
Proof by cases.
Mathematical induction.
3. Sets
Notation and the power set.
Operations on sets.
Generalized unions and intersections.
4. Inequalities
Solving inequalities.
5. Functions
Definition of a function.
Injective, surjective, bijective functions.
Composition of functions and the inverse of a function.
6. Denumerable and uncountable sets
Proving that a set is denumerable using definition.
Facts about denumerable sets. Showing that if A, B are denumer-
able then ABis denumerable.
1
pf2

Partial preview of the text

Download Final Exam - Mathematical Structures | MAT 300 and more Exams Mathematics in PDF only on Docsity!

Mat 300, Spring 2009 Final Exam, 05/12, 9:50-11:40, PSA 113

  1. Operations and quantifiers
    • Operations: conjunction, disjunction, biconditional, conditional.
    • Propositional equivalence.
    • Quantifiers: truth values, negations, and translations.
  2. Methods of Proof
    • Direct and indirect proofs of implication.
    • Proof by contradiction. Irrationality of √ 2 , √ 3.
    • Proof of a biconditional.
    • Proof by cases.
    • Mathematical induction.
  3. Sets
    • Notation and the power set.
    • Operations on sets.
    • Generalized unions and intersections.
  4. Inequalities
    • Solving inequalities.
  5. Functions
    • Definition of a function.
    • Injective, surjective, bijective functions.
    • Composition of functions and the inverse of a function.
  6. Denumerable and uncountable sets
    • Proving that a set is denumerable using definition.
    • Facts about denumerable sets. Showing that if A, B are denumer- able then A ∪ B is denumerable. 1
  • Uncountable sets: set of infinite binary sequences, set of functions from N to { 1 , 2 , 3 }, set of real numbers.
  • Cantor’s theorem with a proof.
  1. Relations
  • Properties of a relation: reflexive, symmetric, transitive, antisym- metric.
  • Equivalence relations and equivalence classes.
  • Equivalence class on A gives a partition of A. Theorem 5.5.1 with a proof.
  1. Limits
  • Proving that limn→∞ an = a using definition.