CSC165H1F - 7th week

In this week we mostly talked about proofs. We proved the limits of a function, learned about the floor of x. Also I learned how to disprove a function. You should negate the implication and you should prove the negation of the implication because if the implication is false the negation will be true and if the implication is true the negation will be false. Also the contrapositive of the implication is equal to the implication so if you have a hard time proving the implication you can take the contrapositive of the implication and prove it. There are different methods for proving. As an example if you know A and B, you can conclude A or B separately. This method is called conjunction elimination. Additionally, we talked about some algorithms for sorting a 5 card euchre hand. These are insertion and selection sort. All quadratic equations are same for computer scientists. On Friday, we did a problem-solving question. According to the Polya's problem solving techniques, first we have to understand the problem. Then, devise a plan, carry out the plan and look back. Me and my group members understood the problem which was given a number of pennies they ask us to find the last amount of pennies. Our plan was to find a pattern and working with small amount of pennies but even we carried out the plan we only concluded how to get 48 from 64 pennies but we haven't finished solving the problem. Thus, we didn't have a time to look back.

I finally got where we did wrong after reading my friend(Starreyes24)'s slog. We had to work backwards to solve the problem. I realized that it is not that hard exercise after looking to starreyes24's slog.