Final Exam Study Guide - Mathematical Reasoning | MATH 310, Study notes of Mathematics

Material Type: Notes; Professor: Nichifor; Class: MATH REASONING; Subject: Mathematics; University: University of Washington - Seattle; Term: Autumn 2008;

Typology: Study notes

Pre 2010

Uploaded on 03/18/2009

koofers-user-b8m
koofers-user-b8m 🇺🇸

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 310B, Fall 2008
Final Topics & Overview
Final Exam: Monday, December 8, 2:30-4:20, MEB 235
You may bring two 8.5x11 sheets of notes (either one or two-sided, but stapled together) and a
calculator.
The final is comprehensive, including chapters 1-14, 19-20, and 24 of the text. The material which was
not covered by the midterm will get somewhat more weight.
Study: Your class notes, the text (examples, proofs, assigned end-of-chapter problems), and the
collected homework problems.
More practice problems are posted (partial solutions will be posted later). Bring questions to reviews or
office hours.
Final exam questions may include computational questions (for instance: counting how many ways you
can do a certain task), definitions, multiple choice or Yes/No questions, short questions like “give the
converse of the following statement”, finding errors in an argument, short proofs, a couple “serious”
proofs.
Main topics per section:
I. Recall the old (midterm) material:
1. The Language of Mathematics: Statements, Connectives (and, or, not).
2. Implications.
3. Direct Proofs and proof by cases.
4. Proof by contradiction.
5. Induction
6. Sets: elements, ways to define/notation, subsets, empty set, operations on sets (union,
intersection, difference), power set of a set, complement of a set.
Thm 6.3.4: results and how to prove them.
Know how to prove a set is a subset of another, or that two sets are equal.
Understand difference between an element and a subset.
7. Quantifiers: universal and existential.
Understand what they are and how to use them. Understand combinations of more than one
quantifier, and negations of such. How to prove and disprove statements involving quantifiers.
Cartesian product: what is it?
8. Functions
Definitions & understand: functions, domain, codomain, image, graph, composition of functions.
Be able to come up with examples!
How to formally prove that the limit of a sequence is (or is not) equal to a number.
9. Functions: Injections, Surjections and Bijections.
Understand, be able to prove or disprove, be able to give examples.
Inverse of a function: what it is, its domain/codomain, and how to find it.
(You may skip: Functions on subsets ( 𝑓
and 𝑓
).)
pf2

Partial preview of the text

Download Final Exam Study Guide - Mathematical Reasoning | MATH 310 and more Study notes Mathematics in PDF only on Docsity!

Math 310B, Fall 2008 Final Topics & Overview

Final Exam: Monday, December 8 , 2:30-4:20 , MEB 235

You may bring two 8.5x11 sheets of notes (either one or two-sided, but stapled together ) and a calculator.

The final is comprehensive, including chapters 1-14, 19-20, and 24 of the text. The material which was not covered by the midterm will get somewhat more weight.

Study: Your class notes, the text (examples, proofs, assigned end-of-chapter problems), and the collected homework problems. More practice problems are posted (partial solutions will be posted later). Bring questions to reviews or office hours.

Final exam questions may include computational questions (for instance: counting how many ways you can do a certain task), definitions, multiple choice or Yes/No questions, short questions like “give the converse of the following statement”, finding errors in an argument, short proofs, a couple “serious” proofs.

Main topics per section:

I. Recall the old (midterm) material:

  1. The Language of Mathematics: Statements, Connectives (and, or, not).
  2. Implications.
  3. Direct Proofs and proof by cases.
  4. Proof by contradiction.
  5. Induction
  6. Sets: elements, ways to define/notation, subsets, empty set, operations on sets (union, intersection, difference), power set of a set, complement of a set. Thm 6.3.4: results and how to prove them. Know how to prove a set is a subset of another, or that two sets are equal. Understand difference between an element and a subset.
  7. Quantifiers: universal and existential. Understand what they are and how to use them. Understand combinations of more than one quantifier, and negations of such. How to prove and disprove statements involving quantifiers. Cartesian product: what is it?
  8. Functions Definitions & understand: functions, domain, codomain, image, graph, composition of functions. Be able to come up with examples! How to formally prove that the limit of a sequence is (or is not) equal to a number.
  9. Functions: Injections, Surjections and Bijections. Understand, be able to prove or disprove, be able to give examples. Inverse of a function: what it is, its domain/codomain, and how to find it. (You may skip: Functions on subsets ( 𝑓 and 𝑓 ).)

II. The new material (after the midterm)

  1. Counting Finite Sets What is the cardinality of a finite set (formal and informal definition). The addition and multiplication principles (proofs and applications) Be able to use the inclusion-exclusion principle.
  2. Properties of Finite Sets Comparing cardinalities via injections, surjections or bijections (applying Corollary 11.1.1, the Pigeonhole Principle, Prop 11.1.4, Corollary 11.1.5, Thm 11.1.6, 11.1.7) Sets with or without minimum or maximum elements. Greatest Common Divisor (what is it & how to find it)
  3. Combinatorics (Counting Functions and Subsets) Know the formulas for:  |Fun(X,Y)|=??  |Inj(X,Y)|=??  |Bij(X,Y)|=??  |P(X)|=??  # of subsets of k elements in a set of n elements=?? For each formula, understand when to apply it (Order matters? With replacement?) What if you have multiple situations? Binomial coefficients & their properties (understand, prove, be able to use.) Binomial Theorem (understand, prove, be able to use.)
  4. Number Systems  Rational Numbers: what they are, showing that + and * of fractions are well-defined, proving a given number is or is not rational.  Real Numbers: understand infinite decimal representations, both concrete ones and using abstract ones in proofs.
  5. Counting Infinite Sets: Which sets of numbers are countable? Which are uncountable? How do you prove it? Be able to determine the cardinality of infinite sets by comparing them to known sets. How many infinite cardinalities are there? Why?
  6. Congruences Understand congruences of integers (definition and examples) and relationship to remainders. Know the properties in Prop 19.1.2 and 19.1.3 (and how to prove them). Applications such as the problems from hwk 8.
  7. Be able to solve linear congruences like the examples from the lecture handout on congruences or your homework.
  8. Be able to apply Fermat’s Little Theorem and Wilson’s Theorem to solve questions like those in hwk 8.

From class notes and handouts: Euclidean Algorithm, prime numbers, etc.