Jeremy Côté

Bits, ink, particles, and words.

Contradiction as Zeros

This is going to be a very quick post, but it’s something I wanted to share since I think it could give some insight into a concept that is used to make proofs in mathematics. When writing proofs, it is often difficult to show that your proof holds for every case (say, if you’re trying to show that the square root of two is not capable of being represented by a ratio of integers). Checking every single combination of integer ratios would take an infinite amount of time, so we want to come up with a strategy that is better. To do this, we try to prove our statement by contradiction. The idea is that we negate our conclusion, and from that, we need to show that there is a logical contradiction. Therefore, when we come to a contradiction, we know that our assumption of negating the conclusion was false, so that means our conclusion is true.

Continue reading ⟶

Conceptual Understanding

As a student, I know what it takes to get good grades. Essentially, you want to be able to reproduce the work that is taught in class during a test. You don’t need to be creative or original in your work. Rather, you simply need to understand the procedures and apply them (for the most part).

Continue reading ⟶

Precision in Language

I imagine that we do this all the time: you’re talking to someone else about solving a certain equation, and then you tell them something to the effect of, “I had to bring sigma to the other side of the equation.”

Continue reading ⟶

Proof that there exists a 3-regular graph for any graph with $k$ vertices, with $k \geq 4$ and $k$ even

Last time, we looked at some concepts in graph theory. In particular, we looked at the ideas of a simply connected graph, the degree of a particular vertex, what edges and vertices are, and some other related concepts. Here, I want to tackle a proof that has a nice way of visualizing the result.

Continue reading ⟶