Thursday, September 15, 2011

Section 2.4.5, due on September 15

I did not quite understand the proof involving the division algorithm. I had a very difficult time following it. Intuitively, it makes sense that every subgroup of a cyclic subgroup is cyclic, but the proof was difficult to understand.

I like how the phi function just keeps summing to 'n'. It seems like it is a very useful function from the properties it holds.

No comments:

Post a Comment