Meets: MWF 9–9:50am, BU 1.
Instructor: Eric
Moorhouse, Ross 216, 766-4394.
A copy of the final exam, with solutions, is now posted below.
Handouts/Links
- Students and Teachers
Working Together (UW policy on the rights and responsibilities of students
and teachers)
- Syllabus / Policies (113 KB)
- Funny Dice (46 KB) handed out on Fri Jan 19, 2007. Includes HW1, due Wed Jan 24
- Want to earn $30,000? Factor this number
(RSA Challenge website shown in class on Wed Jan 24)
- Or win $100,000 by being the first to find a ten-million-digit prime!
The current record is very close to this, a prime having 9,808,358 digits
- Basic Notation and Properties of Integers (67 KB) handed out on Wed Jan 24, 2006. Includes HW2, due Wed Jan 31
- Corrected Solutions to HW1 (162 KB)
- View a Maple session used in simplifying the computations required in HW1, or download the executable
Maple worksheet for this session
- Corrected Solutions to HW2 (117 KB)
- Wed Feb 7 handout on Extended Euclidean Algorithm for Polynomials (44 KB). Corrected!
- Exercises on Polynomial Division (60 KB) handed out on Mon Feb 12. Features HW3, due Mon Feb 19
- Solutions to HW3 (111 KB)
- Towers of Hanoi applet
- Mathematical Induction (195 KB) handed out on Mon Feb 26. Features HW4, due Mon Mar 5
- Sample Term Test (56 KB) handed out on Wed Feb 28
- Solutions to the Sample Test (80 KB). Do not read until you have worked through the sample test yourself!
- On Learning to Read and Write Proofs (120 KB) handed out on Wed Feb 28
- Solutions to HW4 (75 KB)
- Term Test (134 KB) Wed Mar 7. With solutions.
- Chebyshev polynomials featured in class on Mon Mar 19.
These polynomials arose in HW4 #3 using different notation: fn(X)=Tn+1(X) is a
Chebyshev polynomial of the first kind, and gn(X)=Un(X) is a
Chebyshev polynomial of the second kind. View the Maple session shown in class for computing the first
ten Chebyshev polynomials of both kinds, or download the executable Maple worksheet for this session. This is
supplementary information provided for your benefit (I won't be directly testing this material) but they are introduced here as important
examples of families of orthogonal polynomials; and as additional examples of Maple programs.
- A Java applet for explaining the
Fundamental Theorem of Algebra. By default the polynomial f(z) = z3−4z−1 is used
- Mon Mar 26 handout on Complex Numbers (201 KB) including an informal proof of the Fundamental Theorem
of Arithmetic; also HW5 due Mon Apr 2.
- Solutions to HW5 (100 KB)
- Linear Algebra Refresher (125 KB) handed out Wed Mar 28
- Download the freely available KnotPlot software demonstrated in class on Wed Apr 4
- Presentation on Knots from the class of Wed Apr 4
- Handout on Knots (414 KB) from the class of Mon Apr 9, including instructions for computing the
Alexander polynomial of a knot. View a Maple session for computing adjoints of matrices, as required in
determining the Alexander polynomials on pages 5 and 6 of the handout; or download the executable
Maple worksheet for this Maple session
- Polynomial Interpolation (97 KB) handed out during the Mon Apr 16 class
- HW6 (117 KB) due Wed Apr 25. Handed out during the Wed Apr 18 class. Corrected during the Mon Apr 23 class
- Equiangular Lines (119 KB) handed out during the Wed Apr 25 class
- Sample Exam (60 KB) handed out during the Wed Apr 25 class
- Solutions to the Sample Exam (141 KB).
Do not read until you have worked through the sample exam yourself!
- Solutions to HW6 (144 KB). Here is also a Maple Worksheet for the last problem,
on Lagrange interpolation
- The Final Examination (62 KB), Fri May 4; and the Solutions (172 KB)
/ revised January, 2007