1.1-1.2 and 3.1, due September 1

1. I had some difficulty when the readings went into detail about measuring the size of numbers. I didn't follow after the measure in the actual number of digits in a number's decimal representation. To me that seems like a good way to measure a number's size.

2. I was excited to see some proofs and theorems from 290 and 371. I wonder often in my math classes what is this, being some theorem, lemma, etc., good for? I often thought it was just for the sake of knowledge. As I read section 3.1, I was excited to see an application of Euclidean algorithm. I am interested in seeing an application of these principles.

Introduction, due on September 1

I am a senior in mathematics.  I have taken Math 290, 313, 314, 334, 341, 371, and 450. In 290 we covered a little about cryptography and have been intrigued ever since. So, I want to learn more about it.
I have some minor experience with Maple from 314. I have some programming experience from CS142. I wouldn't mind using a CAS for homework as long as there is plenty of time to learn how to use it or a good tutorial.
I really enjoyed taking 341 from Dr. Fearnley. He went at our pace. It gave us time to really discover and understand.
Something interesting about me, I can comfortably shoot a target at 1000 yards.