Skip to main content

Week 5 and 6: Different Ways to Prove Things

Hello readers!!

Welcome to the end of Week 6 of classes and I hope that everyone has done well for the first term test. For me, this was quite the experience, as I've never felt so unsure about my own answers, but we shall see in probably a week or 2's time. I do apologize for not writing over the Thanksgiving break, but I assure you that I will be back on track for the rest of the semester!

Today I'd like to talk about the different ways to prove things. I won't be going into all of them, as some are more self explanatory than others, but I will talk about the ones that I find rather confusing right now, just so I can use this post to help myself sort out some things.

Proof by cases:

When encountering a statement in which you feel that there is more sides to the statement to look at than what you can prove with just one line of thought, then we use proof by cases. We must, of course, think about all the different cases that are possible first, and then we prove each case individually.

Proof by contradiction:

This method of proof is used when you feel that it's probably easier to assume the statement is right (even though you know it's wrong) and to show that it's totally impossible for the proof to work if you keep going down this path!!! It's pretty useful for when your negation statement is difficult to prove or it could be just that the contradiction is easier!

Today's message of the day is to always try to approach a problem several different ways before actually immersing yourself into solving it. It could save you loads of time and effort if you make use of all the tools available to you!

Have a great week everyone!
Lana :)

Comments

Popular posts from this blog

Week 12: Halting Problem Visualized

Hello readers! I'm sure you're all hard at work trying to finish assignment 3. I just wanted to take a few minutes to share with you a video I found on the halting problem. It may be a tad overdramatic (especially with the music) and corny, but it does explain the problem quite well. Here's part 1 (which can be skipped if you want): And part 2, which is where the real explanation of the halting function starts (skip to 2:33 if you don't like corny dialogue): Hopefully this helps with your endeavors (or at least is a bit entertaining)! Good luck with the assignment! Lana :)

Week 5: Tracing Recursion

Hello readers! How have you guys been recently? I have been bombarded with a myriad of tests, labs, and assignments, as usual, but I'll holding up alright! Today's blurb is on tracing recursion! As you all know, a recursive function is basically any function that is called within itself. You'll need it any time a bigger problem can be solved by solving smaller versions of a same type of problem until you get your answer to the big one. Kind of. At least that's how I see it. Anyhow, tracing recursion is not as bad as it sounds, it takes some bit of practice, of course, but all in all it will eventually click. Tracing recursion was on the test this week went successfully I should think. The quasi-solution I came out with with involved the function we needed to trace giving the maximum length of any lists that were fed into it, including the length of the overall list. If I am correct, then my tracing would have been successful. We shall see in due time! Bu...

Week 10: How to solve a problem

Hello my good friends! This week is the coveted fall reading break, and I hope you all are doing something useful with your time, like me, who is currently writing my SLOG. Now that the course is nearing its end, I would like to take it back to the beginning and try to solve one of those logic puzzles, using the Polya method we learned in class. I am, afterall, an amateur logician now, am I not? So here is the puzzle I have found from the problem solving wiki page. So without further ado, I present to you: Walk Tilings Suppose you have tiles that are 1x2 rectangles, and you have to tile a walk that is 2x3 units long. You've got three choices: 3 vertical tiles, 1 vertical tile followed by two horizontal tiles, or two horizontal tiles followed by one vertical tiles. How many choices do you have in tiling a 2x4 walk? How about a 2xn walk, where n is some natural number? Do you have a procedure that works for any n? Understanding the Problem Ultimately ...