week 8

On this week we continued the subject about algorithms, the formal definitions of O and Ω, the analysis of sorting algorithms and proof of worse case scenarios of algorithms. On the end of the lecture, we had a problem solving section. On the tutorial, we actually proved the the cases we did the structure on the last week tutorial.

week 7

On this week we learned about proof by cases, where we divide the proof in different cases and proof each case separately, and we had a review about all kind of proofs, and about the Fermat's last theorem. Them, we started our studies about algorithms analysis and asymptotic notations. On the tutorial, we reviewed about proof structures, which is quite simple.

week 6

On this week, we learned more about other cases of proofs, like non-boolean functions, limits and when something is false. Non-boolean functions are functions that don't end in true or false answers, like x > 5, or floor of x, which is the largest integer number <= than x. Also, to disprove a statement we need to prove the negation of that statement. Proof about limits get a little more challenging then the others proofs, I believe that I will take more time to understand better. We didn't had tutorial this week.