[an error occurred while processing this directive]

<H2>Notes</H2>
Supplementary notes may be posted here from time to time.

<center>
<table>
<tr><th>Chapter<td width=10%><th align=left>Title<th align=left width=15%>Pages<th width=10%>Size (Approx)</tr>
<tr><td align=center> 1.2 <td><td><a href="../Handouts/gauss.pdf">Gaussian Elimination</a>
    <td>4 Pages <td align=center>73K</tr>
<tr><td align=center> 1.3 <td><td><a href="../Handouts/mx.pdf">Matrix operations</a>
    <td>6 Pages <td align=center>90K</tr>
<tr><td align=center> 4.1 <td><td><a href="../Handouts/euclidean-n-space.pdf">Euclidean <i>n</i> Space</a>
    <td>4 Pages <td align=center>80K</tr>
<tr><td align=center> 9.8 <td><td>
    <a href="../Handouts/gauss-complexity.pdf">Complexity of the Gaussian Algorithm</a>
    <br>(Includes exercises)<td>5 Pages <td align=center>87K</tr>
<tr><td align=center>Number Fields
    <br>(Not in book) <td><td>
    <a href="../Handouts/finite.pdf">Finte Fields</a>
    <br>(Includes exercises)<td>14 Pages <td align=center>120K</tr>
<tr><td align=center>Coding Theory
    <br>(Not in book) <td><td>
<a href="../Handouts/codes.pdf">Coding Theory</a>
<br>(Includes exercises)<td>6 Pages <td align=center>100K</tr>
</table>
</center>

<p>
There is a nice implementation of the Euclidean algorithm
<a href="http://www.math.umn.edu/~garrett/crypto/a01/Euclid.html">here</a>

<!--
<H2>Textbook:</H2> <i>Elementary Linear Algebra, Applications Version</i>
8th ed., by H. Anton and C. Rorres.

<p>
There is also a non applications version of this book. You can use this 
version, but you will be missing chapter 11. It is your responsibility to
ensure that you have access to this material were necessary.
-->