Review Topics Exam 2 18.310 2002

Euclid’s Algorithm perform it to find gcd and express same as linear combination of original numbers with integer coefficients

The Chinese remainder theorem use it to prove statements about solutions to equations mod products of primes

Groups and Lagrange`s theorem: be prepared to prove it and use it

symmetries of the square and multiplication table of them what are they?

FFT set up an N=16 fft and use it to multiply 2 8 digit numbers

RSA create an rsa code and code and decode with it

raising to a power mod n: be prepared to do it

finding primes” explain how it is done: find one in a certain range with a spreadsheet

testing primality describe and apply test

linear programming: model a situation, esp network flow or resource allocation

the quadratic sieve describe it

the tortoise and the hare be prepared to do it on a spreadsheet

magic determinant finding; set up spreadsheet and do this

doing the simplex algorithm be able to do pivots on a spreadsheet

finding a feasible origin explain how this is done

duality take the dual of a given primal; (doing this right requires practice!)

multiplying matrices set up a spreadsheet to do this

graphs and planarity outline proof of Kuratowski’s theorem

five color theorem prove it

eulers formula state and prove it

be prepared to set up spreadsheets to implement

1,5,6,7,8,9,12, 13,14,17

be cognizant of the meaning of

2 3 4 10 11 15 16 18 19 20