Math 242 (Modern Computational Mathematics)
(Professor McKelvey)
Homework, Fall Term, 2009


Any items in red have not been officially assigned yet.
You can get a head start on these assignments if you want, but be aware that some
changes in the assignment may be made before the assignment becomes official.

Assignment
Number		 Date
Assigned		 Date
Due		 Assignment
9 11/1912/1 Dynamic Programming Click Here for the assignment.
8 11/1211/19 RSA Encryption Example Click Here for the assignment.
7 11/5 11/12
  1. Let a=1639197 and b=29913. Use Euclid's Algorithm to verify that g.c.d.(a,b) = 177. Then, using the results of Euclid's Algorithm, find integers m and n so that m*a + n*b = 177.
  2. Use the Sieve of Eratosthenes to find all the prime numbers between 2 and 510. You can use this sheet of paper to help with your work.
  3. Use Fermat's Algorithm as presented in class to completely factor n=22733.
  4. Use the factorization (a^3-b^3)=(a-b)*(a^2+ab+b^2) and the idea of Fermat's Algorithm to create an algorithm like Fermat's to factor numbers. Describe your algorithm in detail. Use your algorithm to factor 1267, showing all the details of your work
6 10/2911/5 Fourier Series, Composite Simpson, Page Rank
Click Here for the assignment. (PDF)
5 10/2010/27 Digital Signal Processing Click Here for the assignment. (PDF)
4 10/810/15 Differential Equations and lsoda in R. Click Here for the assignment. (PDF)
3 9/2910/8 Markov Chains, Difference Equations and Graphing in R:
Click Here for the assignment. (PDF)
2 9/179/29 Markov Chains: Click Here for the assignment. (PDF)
1 9/109/17 Euclid's Algorithm: Click Here for the assignment. (PDF)

Disclaimer