2.1

First the normal questions:

  1. I did read the entire section. The hardest part was figuring out where some of the inequalities at the start came from (still don't know on some of them) and also following the proof for Stirlings approximation, which is just going to take some more intense reading/walkthrough on my part.
  2. This is honestly one of the hardest ones I've had yet to relate to another class. I also don't quite see the application of the approximation, although I'm sure it'll become apparent with more time.
The question on the reading assignments page on Dr. Jenkins site:
  • I spend anywhere from 1 1/2-3 hours on the homework depending on the assignment. Lectures and reading ABSOLUTELY prepare me for it - I also feel pointed in the right direction when I start.
  • The homeworks have probably contributed the most to my learning. They require lots of thinking/pondering and to "get dirty" and actually play around with some of the math.
  • Maybe trying to understand the readings more thoroughly before class, because sometimes some of them go right over my head.

Comments

Post a Comment

Popular posts from this blog

1.9

I read the entire section. The hardest part for me was wrapping my head around what it meant for two numbers to be congruent. Through the reading I was able to grasp it more, but I need some more time with it. I did understand it enough for Fermat's Theorem and it's proof to make sense though. More than anything this reminded me of quotient spaces that we're learning about in 344. They're similarly defined/explained with modulus and equivalence classes. There's definitely and underlying thread that runs through both of them.
Read more

3.1

I did read the entire section. The hardest thing for me was simply remembering all the definitions. Walk, cycle and path all seem like they could mean the same thing, so just getting used to distinguishing them. The concepts themselves weren't terribly hard. This reminds me of a discrete math class I took where we covered graph theory pretty extensively. A lot of the theorems I saw in the book I recognized from that class. It was mainly a class for CS majors, and it's cool to finally see how graph theory connects to data structures since we never covered that before.
Read more

1.3

I did read the entire section. The hardest part for me was becoming comfortable at considering/seeing a summation as a type of integration of functions on discrete sets. I have seen the difference operator before, but never the summation. I don't know if it's a difficult thing as much as I need some time to get my hands dirty with it. Like I said before, I had a class where we covered the difference operator briefly. We used in mainly to solve recurrence relationships, and I imagine we'll do something similar here. I found it really cool how simply it fits into the summations as a relationship similar to that of integration/differentiation.
Read more