Skip to main content

Introduction, due on September 7

Introduction:

I have both a bachelor's degree and a master's degree in Math from BYU. I am auditing and a non-degree seeking student. (So I have no year in school or major...)

I have had Math 290, 313, 314, 341, 371, 342, 334, 541, 553, 542, 554, 532, 641, 655, 571, 642, 572, 586, 513R (Mathematical Biology), 651, and 652. (updated numbers except for those that are no longer taught.)

I chose to do ACME because it sounds fascinating. I want to know how to apply the math I know to the real world. Programming is not something I am strong in, but it is important for most applications. My theoretical background is good, but I want to branch out and have other options.
And as I work to figure out what to do next with my life, I want options.

One of my professors years ago would sit in front of the classroom and read the book to me. (I was the only student in the class.) It was not so helpful. I wish he would have supplemented the material rather than just sticking so closely to the book. (To be fair, I could have studied ahead of time and come with questions. But I just followed what he did.)

I once gave a random soccer fan in Germany a free cake. He was confused.

I am generally on campus from 9 to 2. So sometime between 11 and 2.

Comments

Post a Comment

Popular posts from this blog

7.2 due November 19

The thing I didn't understand about this section is why we need to use a distribution Q instead of just sampling uniformly (which I guess is a distribution...) when we are trying to do rejection sampling. I think it is because it speeds things up as it will have fewer rejections than a rectangle would. This section seems like we are learning more of what we just learned. I understand most of it, but I'm not sure I would recognize when I should use any of the techniques in this section.
Post a Comment
Read more

4.2 due October 10

The hardest thing for me in this section is following all the details of actually implementing a search. The general "go here, then here, then here" makes sense, but keeping track of all the stacks and dictionaries and lists is what takes me the most time. I liked the cartoon example of what a depth first search would look like in real life. It both made me laugh and made me think.
Post a Comment
Read more