The most difficult part of the reading was understanding the proofs involving congruence of integers. Once I understood what the "congruent to... modulo" statement meant mathematically, I realized how simple the proofs were but until that point, it did not make much sense.
I was rather excited when seeing the statements about how for a given integer x, 2 divides (x - 0) or 2 divides (x -1). Also 3 divides (x - 0), 3 divides (x - 1) or 3 divides (x - 2). It seemed exciting because for the general case of an integer n, n divides (x - 0), n divides (x - 1) ... n divides (x - (n - 1)). This could be applied when dealing with proofs involving sets. I am excited to deal with proofs of more general cases.
No comments:
Post a Comment