Section 1.1-1.2, 3.1, due on September 2

1) The most dificult part for me was the GCD algorithm. I have really ever cared to understand how it needs to work, since it is not something that you need to code all that often. I know that this is not a very hard part, but all the other sections are things we have covered extensivly in other CS classes.

2) The most interesting part for me was the prime number theorum. I have seen that there were a lot of large prime numbers, but I never knew that their was a formula that would allow us to solve for this.

Introduction, due on September 2

I am a Senior with a major in Computer Science and Chinese. I have taken Linear Algebra and Multi-variable calculus. I am taking Math 485 because I have always been interested in Cryptography, and because this class has less pre-reqs then number theory.

I have experience in mathamatic. As for programming experience outside of these programs I am at an expert level.

My best Math professor was Jeffery Humpherys. He made everything we did very applicable. Too often math classes focus only on purely numeric problems that have no relation to real problems that math is used for. Dr. Humpherys was able to have several mathamatica labs that allowed us to apply the linear algebra we were learning to real problems.

An interesting fact is that next year I will be taking CS class at NanJing university in China as part of the Chinese Flagship program.