Difficult: Compared to the previous chapters of crazy sizes of infinities and messy piece-wise functions, these chapters were pretty nice. I would like to see the Division Algorithm proved again; it does have some tricky parts which it uses.
Also, could you clarify the connection between remainders, dividends, and equivalence classes? I understand that remainders and dividends will be in the same equivalence classes (mod divisor), but how does that prove that the equivalence classes are pairwise disjoint exactly?
Interesting: I think number theory is way interesting. In some of the Math Careers talks I've been to, they've talked about finding REALLY big prime numbers, which I'm sure uses a whole bunch of number theory. =)
No comments:
Post a Comment