August 31, 2016, 2.0

1.1
Difficult: Remembering that the Division Algorithm requires b > 0.
Reflective: It seems Corollary 1.2 is an easier-to-remember version of the Division Algorithm.  I like it!

1.2
Difficult: It looks hard to come up with a back-substitution in the Euclidean Algorithm to show the gcd as a linear combination of the two integers.
Reflective: The greatest common divisor is a linear combination of the two numbers it divides.  Does that mean, consequently, that a number cannot be a linear combination of two numbers if it is not a common divisor?

1.3
Difficult: I'm having a hard time understanding Theorem 1.8
Reflective: Why is the Fundamental Theorem of Arithmetic important?  It just seems to be a tautology to me.

August 31, 2016

My name is Katie Jacobson.

I'm a senior graduating in December.

I've taken Math 290, 313, 314, 334, 341, 320, 321, 344, 345, 322, 323, 346, 347 (I did one year of ACME)

I'm taking this class because I switched to the regular Math major so I can graduate sooner.

Dr. Jarvis has been one of my favorite math teachers.  He not only was able to teach well to a class setting, but made time for one-on-one personalized help if needed.  He was great at breaking difficult concepts into simpler sub-concepts that made sense.

I was part of BYU's International Folk Dance team for three years and the Women's Ultimate Frisbee team for a semester.