The final examination is on Wednesday May 6, 1--3pm.
Exam topics
Problems will be similar to those appearing on the homework and the in-class worksheets. You will not be asked to reproduce the proof of any theorems, but make sure you know the definitions and how to apply the theorems.

Exam 3 solutions

Exam 3 is on Monday April 13, held during lecture.
The exam covers material from 12AD, Coding Theory Sec 1.1 - 2.7, 13AB, 14ABC.
Problems will be similar to those appearing on the homework and the in-class worksheets. You will not be asked to reproduce the proof of any theorems, but make sure you know definitions.

Exam 2 solutions

Exam 2 is on Friday March 6, held during lecture.
The exam covers material from 6ABCE, 7ACD, 9ABC, 10AB, 11ABC.
You may be asked to reproduce the proofs of one of the following theorems:

Characterization of units in Z/mZ (Section 6E Theorem 5)

Characterization of zero divisors in Z/mZ (Section 7C Theorem 12ii)

Wilson's Theorem (done in lecture: if p is a prime, then (p-1)! cong -1 mod p)

Exam 1 solutions

Exam 1 is on Monday February 2, held during lecture.
The exam covers material from 2ABC, 3ABCDE, 4ABC, 5ABEF.
You may be asked to reproduce the proofs of one of the following theorems:

The Well-Ordering Principle implies the Principle of Induction (done in lecture).

The Principle of Induction implies the Well-Ordering Principle (Section 2C Theorem 8).

The Fundamental Theorem of Arithmetic (existence and uniquess) (Section 4A Theorem 1 and Theorem 2).

Bonus Problem 1

Also see the mathemagician Arthur Benjamin give a TED talk on various math tricks.

Well-Ordering Principle implies the Principle of Induction

This space serves as the Class Blog for MA 340, Spring 2015.
All course announcements will be posted here. Check frequently!

Errata for A Concrete Introduction to Higher Algebra.