This Wednesday we took our first
term test. Honestly speaking the term test was not as difficult as expected and
surprisingly similar to the practice test
Now to proofs.
Doing proofs is like solving
mazes drawn on paper. You know where to start and where you want to end, all
that is left is the “middle part”. You can work towards the result from the
start (implication), or you can work backwards from the end (result). Doing
proofs require a much better understanding of the problem and solution, and it
is this that differs it from solving computational problems. One proof that we
went through in class that I find interesting is Euclid’s proof that there are infinitely
many prime numbers. The proof showed creativity with the use of contradiction and
demonstrated full understanding of the subject by using the prime property that
every integer >2 has a prime divisor. The proof was difficult to understand
when reading it the first time, and I can only imagine how difficult it is to
construct it from scratch.
No comments:
Post a Comment