Oh boy. And I thought regular modular arithmetic in Zn was rough. I still find the first chapter of that confusing, when they talk about things like 17=5(mod6). It's really not any different here in F[x] modulos except that we're talking about functions now.
Reflective:
It's kind of fun to see them give a theorem using functions and for the proof, just ask you to adapt the proof from chapter 2, using functions in place of integers.
No comments:
Post a Comment