FINAL EXAM INSTRUCTIONS
The final exam is on Monday, March 14, 4:00-6:00pm in ET 202
(See WEBSOC)
SAMPLE PROBLEMS EXAMPLES OF PROOFWRITING
There will be six problems, each worth 5 points. Please see the
information on grading
the exam.
The problems will be on the following topics:
1. Euclid's algorithm and its use to find solutions of linear
Diophantine equations.
2. Proving that two sets given in terms of intersection, union, set
difference and Cartesian product are equal
3. Finding the image and the inverse image of a set under a given
function.
4. Determining whether a given function is surjective/injective.
5. Proving that a given binary relation is an equivalence relation,
and finding its equivalence classes.
6. Writing a proof of a statement in number theory. Here the
emphasis is on the correctness of the argument as well as on good
and precise proofwriting.
HOME MATH 13