Difficult: The most difficult part of these sections is using the Euclidean Algorithm to find a linear combination of two large numbers for a gcd. Small numbers aren't a problem, but large numbers are. The Division Algorithm and Thm 1.10 (all numbers can be written as a product of primes) were longer and I couldn't reprove them yet, but they make sense and I have seen them before.
Reflective: I found divisibility to be the most interesting part of these sections because the proofs in the book and homework were straightforward, fun little puzzles. I know 371 is all about groups and rings, even though I don't know what those are yet. I wonder how important primes are to them?
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment