1.6, due on Monday September 18



Did I read/what was the hardest part?

I don’t fully understand why the integers are not well-ordered, when any Z^>=n is. I also don’t really get Theorem 2.1.8 about how d can be both the least and the greatest positive integer that divides both a and b.

How does it apply to life?

I think it’s really cool that we can teach computers to do division in the same way that we were taught to do in elementary school. By defining the relation as a linear combination instead of using division in the definition, we are able to verify that the algorithm holds without needing the computer to try and divide by 0. Also, I think it’s really nice that we have application examples at the end of each section.

Comments

Post a Comment

Popular posts from this blog

8.6, due Friday 12/8

Difficult: Honestly, this whole thing is a bit fuzzy to me. I'm not quite sure how it works. I feel like I won't fully understand until I do a lab on it. Application: well, the picture of the mandrill was interesting. How sure are we, though, that this is how the FBI does fingerprints?
Read more

8.7, due Monday dec 11

Difficult: I think I need to go back and review compact support. Also, much like the last section, I don't think I'll fully understand this one until I do the HW and/or code it up. Application: I feel like every section says, 'the last approximation is good for some things, but not for this new thing'. It's just interesting.
Read more

8.1, due Nov 27 17

Difficult: The hardest part was following all of the integrals going on. The idea of fourier transforms is interesting, but I don't know how well I'll actually be able to follow it. Also, how is having a basis for only a subset of F make a suitable basis for all of the functions/signals we care about? Application: I've seen some of what DFT/FFTs can do, and it's super cool. I'm excited to see how we can apply this to audio and visual conversions!
Read more