9.6-9.7, due on October 29

DIFFICULT
Does Bijective also mean Inverse?  Since in order for a function to have an inverse it has to be bijective.  I am not sure what is happening in Section 9.7.  I'm having a hard time visualizing what 9.7 is talking about.  Things make more sense after lecture anyways to me anyway.

REFLECTIVE
Seeing inverse functions again.  Section 9.6 seems pretty straight forward and easy to understand.  Chapter 9 seems to be a pretty intuitive chapter, probably because it is familiar material.  I kind of understand what a Permutation is although I don't think I've ever seen it before.

9.5, due on October 27

DIFFICULT
The proofs we've had to write in this chapter have been challenging just because they are simple.  The Theorems and Corollary that are present in this section are kind of confusing.  Also just remembering definitions will be a difficult task.

REFLECTIVE
I'm really liking this chapter.  Learning different concepts about topics that are already familiar to me.  I just feel like chapter 9 is leading up to something bigger, and now we are just seeing a partial view of the whole.

9.3-9.4, due on October 23

DIFFICULT
The Onto functions in 9.3 are difficult for me to understand, and I think its because I am unclear of what the difference between codomain and range is.  I don't understand what a Bijective Function is or what its difference is between an injective function is.

REFLECTIVE
Section 9.3 talks about one-to-one functions, which have been discussed in calculus.  They are functions that pass the vertical and horizontal line tests.

9.1-9.2, due on October 22

DIFFICULT
The difficult parts of these two sections will be the definitions, and remembering them all.  I also found that the first section contains a lot of math language that is hard to follow for the untrained eye.

REFLECTIVE
These sections seem pretty clear that we are talking about the same functions we were taught about in other math classes, with just a little more words to do it and with more definitions.  I am interested to see how the lecture goes tomorrow morning.

8.6, due on October 20

DIFFICULT
This section seemed pretty self explanatory.  The only things that were different for me to understand are closed under addition and multiplication, but I assume those will be explained in class.

REFLECTIVE
I find this equivalence class stuff pretty interesting, how they set up a Partition.  This section was very similar to what we have seen in this chapter, so it was pretty easy to understand.

8.3-8.4, due on October 15

DIFFICULT
The transitive relationship is nebulous to me.  In class on Monday it was really hard for me to understand, especially with the group activity.  I would like some examples that help clarify that topic, it seemed like everyone else understood it, so maybe I will go to your office hours.

REFLECTIVE
These sections are just appendages to what we have been talking about on Monday.  So besides the things discussed in the difficult section, I feel pretty good about the material discussed here.

8.1-8.2, due on October 13

DIFFICULT
Section 8.1 was pretty intuitive.  Although since these sections are using sets, they might be harder than what I initially thought.  I think the hardest part of these two sections will be remembering all the definitions and how to apply them.

REFLECTIVE
Section 8.1 was pretty intuitive.  Although there are quite a bit of definitions, they should be pretty easy to understand after lecture tomorrow morning.

6.4, due on October 10

DIFFICULT
Again the topics discussed in 6.4 look very similar to those found in the previous sections.  Section 6.1 and 6.2 were very similar, and it looks as if 6.4 is also very similar.

REFLECTIVE
I've seen these topics and such discussed in 6.1 and 6.2.  Although now they can be applied to recursive series.

6.2, due on October 8

DIFFICULT
This section is more of the same as last section was, just with more applications of Induction.  This stuff doesn't seem to difficult to understand, although I haven't done the homework due Wednesday yet.

REFLECTIVE
This is the same stuff we talked about with the other professor on Monday.

6.1, due on October 6

DIFFICULT
The implication P implies P(k+1) might need some explaining and why it's called Mathematical Induction.  I think what I need most out of this section is seeing some different examples.  I don't see how Proof by Induction works.

REFLECTIVE
The idea behind least element isn't hard to understand and is intuitive.  I have heard the Gauss story before.  I have used that ratio that Gauss came up with before too.

Exam 1, due on October 2

Which topics and theorems do you think are the most important out of those we have studied?

1.  Understanding truth tables and their applications to proofs.

What kinds of questions do you expect to see on the exam?

1.  I expect to see a combination of questions that reflect my understanding of sets, logic, contrapositive, direct proofs, counter examples, contradictions, and everything else we've learned.

2.  If this exam is to take the average person 1.5 hours.  I expect to see a section of definitions, and like less-than 10 proofs.

What do you need to work on understanding better before the exam?

1.  I could use some help with anything regarding sets and there operators.