What did I find difficult?
Chapter 9.6 is about inverse functions. I had more difficulty with this section that I did with 9.7. Prior to reading this chapter, I did understand that the inverse of a point is just switching the x and y term. For example, if you have (x,y), then the inverse relation of that would be (y,x). Reading through the proofs led to difficulties in understanding how to go about proving the inverse relations. I will need more practice in solving these problems.
Chapter 9.7 is about permutations. We are learning about permutation testing in my Nonparametric Statistical Methods class. I find them very interesting. From the book, a permutation of (or on) a nonempty set A is a bijective function on A, that is, a function from A to A that is both one-to-one and onto. For 9.7, I was confsued by the illustrations of 213 about the composition of any two permutations. I thought I understood that, but the visual given with the matrices was difficult for me to understand.
What did I find interesting?
Like I said before, we are learning about permutation tests in one of my stats classes ( 435 nonparametric with Dr. Grimshaw). From an earlier probability class I have taken at BYU I have learned how to count the number of permutations. I like the drawings and visual explanations that they used in the book on page 212 to show the ways to represent the permutations of {1,2,3} in a 2x3 matrix.
Chapter 9.6 is about inverse functions. I had more difficulty with this section that I did with 9.7. Prior to reading this chapter, I did understand that the inverse of a point is just switching the x and y term. For example, if you have (x,y), then the inverse relation of that would be (y,x). Reading through the proofs led to difficulties in understanding how to go about proving the inverse relations. I will need more practice in solving these problems.
Chapter 9.7 is about permutations. We are learning about permutation testing in my Nonparametric Statistical Methods class. I find them very interesting. From the book, a permutation of (or on) a nonempty set A is a bijective function on A, that is, a function from A to A that is both one-to-one and onto. For 9.7, I was confsued by the illustrations of 213 about the composition of any two permutations. I thought I understood that, but the visual given with the matrices was difficult for me to understand.
What did I find interesting?
Like I said before, we are learning about permutation tests in one of my stats classes ( 435 nonparametric with Dr. Grimshaw). From an earlier probability class I have taken at BYU I have learned how to count the number of permutations. I like the drawings and visual explanations that they used in the book on page 212 to show the ways to represent the permutations of {1,2,3} in a 2x3 matrix.
No comments:
Post a Comment