Math for CS: Problem Set 4 Thoughts

Problem 1: I have an idea of how to solve this problem. I just need to prove that no matter what step we take from (m, n), except when m = 0 and n = 0, m and n will never be equal to each other. I could look up an example induction proof from the lessons to attempt to prove it, but instead I am going to look at the solution.

Problem 2: I understand what they’re asking for. The hard part is proving it. I’m stuck, will look at solution.

Problem 3: Again, I understand what they’re asking for. I just don’t know the answer or how to go about answering it. Going to look up solution here too.

I don’t see these type of problems being used practically, so I’m not going to waste much time trying to solve them after an initial attempt.

The solution to problem 1 is clever.

Problem’s 2 and 3 there’s a lot going on there. Since I don’t think these concepts will be super important practically, I’m going to just read, but if I don’t fully understand I’m going to move on.

I could spend more time with the proofs until I fully understand, but I don’t think that’s pragmatic right now. I might spend more effort understanding proofs from OSSU Core Theory section though.