THE FINAL

I already did my evaulations last week.  And to study for this exam, I am going to make sure I am very familar with all the definitions of all the terms we have learned about.  I am going to make flashcards to study over the weekend.  I really need to review the stuff from the start of the semester, although I think I will understand it better now, because I feel like I am grasping the concepts better now.  I know as I continue on all the mathematical notations and proof strategies I have learned will only  help me in being more succesful as a math education major.

12/4-12/5

I liked the section on fundamental properties of limits of functions.  It was cool to see the proofs of why the limit tricks that I learned in 113 really work.  In section 12.5 about continutity, I liked how it gave you those three specific conditions that ahve to be satisfied in order for a function to be continuous, it made it nice to know the outline when trying to prove if something is continuous. 

12.3

I loved this section! Cause I already know how to do it!  The only parts I think might be kinda difficult it when I am supposed to prove a limit doesn't exist by contradiction.  Sometimes I have a hard time with those ones.  But I think it will be more clear after class tomorrow! I hope we get our tests back. 

12.1

CALCULUS!!!
I liked this section because it was all very familar to me.  I think I understood most of it, and i've seen this kind of proof before, so I'm hoping it just becomes even more clear tomorrow in class.  I like that with a little math you can easily decide what needs to be used in order to make the proof work. 

11.5

Relatively Prime Numbers
Relavively Prime Numbers mean that two number have no gcf other than one.  So the number might not be prime on its own, but when paired with another number they are both relatively prime,  like 20 and 7.  I think that Euclid's Lemma will be very useful when working with relatively Prime numbers and make proof quite a bit easier. 

11.3-11.4

29000!!!!

Last night I went to the Hunger Games Movie, and thus I forgot to BLog, but I figured if I did this morning before class, that that would be okay. 

11.3 Greatest Common Divisors: This section was a nice review about greatest common divisors.   And it was cool to see the proofs and why this worked. 

11.4 The Euclidean Algorithm: This is a cool way to find the gcd, I liked how you just start dividing and deviding by the numbers you get, and it leads you to the gcd once you have to add 0 to get the number before. Math is cool.

11.1-11.2

The first section was simple because it was math I have been farmilar with for quite some time, Divisibility properties of integers.  The division algorithm will be a little harder to understand, but it makes sence the formula b=aq+r with a= some number, q=quotient devided by, and r=remainder after the division.  It doesn't seem too tricky.