Chat GPT on the midterm

I fed in the latex question file to ChatGPT, although instead of the image of the axioms P1-P12 I referred it to the axioms in Spivak’s book. It came up with the following, which I would grade as 80/100.

ChatGPT does Calculus

Posted in Uncategorized | Leave a comment

Midterm

The mean for the midterm was 64 (by section: 59 for one section and 72 for the other). A smoothed density graph of the grades is as follows:

density plot

You can also find solutions at this link.

Posted in Uncategorized | Leave a comment

Tips for Homework submissions

A reminder about the HW and grading:

  • The grading on each individual HW might have a different total, but the points for each HW will be the same.
  • Your lowest normalized HW score will be dropped, and your HW score will be based on all your other HWs.
  • A reminder: you can have one HW late during the course with no explanation needed. You will then get a 72 hour extension on those HWs. HWs submitted later than that will not be graded.

Finally, here are some requests from the graders! Following these instructions will help you avoid unneccessarily losing points.

  1. Assigning pages to the correct solution in Gradescope helps us grade efficiently and ensures you receive accurate feedback. With over 50 submissions to review, this step is crucial. Assign your pages properly.
  2. If submitting handwritten solutions, write clearly—unclear handwriting can result in reduced marks even for correct answers. You are encouraged to learn math typesetting with LaTeX (e.g., Overleaf).
  3. Please scan your handwritten solutions properly! PDF format is preferred over an image. If we can’t read it, we can’t grade it.
  4. You are encouraged to talk to your classmates and help each other. If you are facing an issue, like not being able to find the latest edition of a book, please talk to your classmates. For that, you need to start working on the HW earlier. Last-minute notices or requests will not be entertained in the future.
Posted in Uncategorized | Leave a comment

The Sticks Game

Although I did this in class, I thought it might be useful to write out a proof here. There are many variations, but it should look something quite similar to this.

Claim: For \(n = 0,1,2,\ldots\) a non-negative integer, the winner of the sticks game is as follows:

  1. If there are \(3n+1\) sticks, then the player to move loses.
  2. If there are \(3n+2\) sticks, then the player to move wins.
  3. If there are \(3n+3\) sticks, then the player to move wins.

Proof: We give a proof by induction starting from \(n = 0\). Let \(P(n)\) mean that the three listed statements above are true for \(n\).

Base Case: Suppose that \(n=0\).

  • If there is one stick, then the player to move has to pick up the stick and so loses.
  • If there are two sticks, then the player to move can pick up one stick, and then the next player has to pick up the final stick and so loses, and hence the first player wins.
  • If there are two sticks, then the player to move can pick up two sticks, and then the next player has to pick up the final stick and so loses, and hence the first player wins.

These three statements prove \(P(0)\) is true, which is the base case.

Inductive Step: We shall assume \(P(k)\) and show \(P(k+1)\).

  1. If there are \(3(k+1) + 1 = 3k+4\) sticks, and the player to move picks up one stick, then there are \(3k+3\) sticks remaining. But since we are assuming \(P(k)\), this means that the second player (who is now the player to move) wins, which means that the first player loses. On the other hand, if the first player picks up two sticks, there are \(3k+2\) sticks remaining. Again by our assumption \(P(k)\), this means the second player wins and the first player loses. So whatever the first player does, he will lose. So if there are \(3(k+1)+1\) sticks, the player to move loses.
  2. If there are \(3(k+1) + 2 = 3k+5\) sticks, then the player to move can pick up one stick, and there are \(3k+4\) sticks remaining. Now by part \(1\), the second player (who is now the player to move) must lose. Thus the first player can always win.
  3. If there are \(3(k+1) + 3 = 3k+6\) sticks, then the player to move can pick up two sticks, and there are \(3k+4\) sticks remaining. Now by part \(1\), the second player (who is now the player to move) must lose. Thus the first player can always win.

Thus assuming \(P(k)\) we have shown \(P(k+1)\) is true, and so by induction we are done!

Remarks:

  1. Notice how wordy the proof is! That’s a feature not a a bug; communicating in sentences is often a really clear way to convey ideas. It is often the case that mathematical notation is more compact and it is useful for that purpose, just make sure it doesn’t obscure what you are actually doing.
  2. Note that in the case \(n = 3k+5\) and \(n=3k+6\) we used the case \(n = 3k+4\) which was not part of \(P(k)\), but part of our argument showed that the case \(n = 3k+4\) did follow from \(P(k)\). That is fine — it just means that it took a few steps for us to prove \(P(k+1)\) only assuming \(P(k)\). Another interesting feature of the argument is that when deducing \(P(k+1)\) we didn’t even use the fact about the game with \(3k+1\) players.
  3. The sticks game is a special case of a more general game called nim. Although the more general game is a little more complicated, ultimately the analysis is quite similar and the proof (given at the link) is by induction.

Added: A real life application of the sticks game (or a simple variant): Try to solve it in real time

Posted in Mathematics | Tagged , , , | Leave a comment

Some common proof mistakes

Let’s discuss a number of classic mistakes one can make when writing down a proof.

THE WRONG ORDER: We start with proofs where the argument goes in the wrong order.

Claim: For all numbers \(a\) and \(b\), there is an inequality \(a^2 + b^2 \ge 2ab.\)

Let us also recall that we have already proven that, for any number \(c\), we have \(c^2 \ge 0\) (this is discussed in Spivak).

Bad proof: We have:
\[\begin{aligned} a^2 + b^2 & \ge 2 a b \\
a^2 + b^2 – 2 a b & \ge 0 \\
(a – b)^2 & \ge 0,\\
\end{aligned}
\]
and all squares are positive, so the inequality holds □

The problem: This argument starts with the claim that is to be proved, and then makes (correct!) deductions to end up with a true statement. But that is the reverse of what we want to do. If you start with a true statement and then make correct deductions you end up with something that is true. But you can start with a false statement, make correct deductions, and end up with something that is true. For example, if you start with \(1 = 2\) and you multiply both sides by \(0\) you get \(0 = 0\) which is, true, even though \(1 = 2\) is false! If you find yourself arguing this way, the fix is to to try to “turn your argument upside down”, like this:

The fix: All squares are positive, and so if \(c = a-b\) then \(c^2 \ge 0\). Hence
\[\begin{aligned} (a-b)^2 & \ge 0 \\
a^2 + b^2 – 2 a b & \ge 0 \\
a^2 + b^2 & \ge 2 a b,\\
\end{aligned}
\]
so the inequality holds □

This is almost the same word for word!

NOT ENOUGH WORDS OR DETAILS

Claim: Show that
\[ \frac{1}{1 + \sqrt{2}} + \frac{1}{\sqrt{2} + \sqrt{3}}
+ \frac{1}{\sqrt{3} + \sqrt{4}} = 1.\]

Bad Proof:
\[ \begin{aligned}
\frac{1}{1 + \sqrt{2}} + \frac{1}{\sqrt{2} + \sqrt{3}}
+ \frac{1}{\sqrt{3} + \sqrt{4}} & = \sqrt{2} – \sqrt{1} + \sqrt{3} – \sqrt{2} + \sqrt{4} – \sqrt{3} \\
& = 1. \end{aligned} \]

This is not wrong exactly, but it might really be confusing if you don’t know what’s going on. Here’s an improvement:

The fix: Remember that \((b+a)(b-a)=b^2-a^2\). Now we note that
\[ \begin{aligned}
\frac{1}{\sqrt{a+1} + \sqrt{a}} & = \frac{1}{\sqrt{a+1} + \sqrt{a}} \cdot
\frac{\sqrt{a+1} – \sqrt{a}}{\sqrt{a+1} – \sqrt{a}} \ \text{where we multiplied a factor $A/A = 1$} \\
& = \frac{\sqrt{a+1} – \sqrt{a}}{(\sqrt{a+1} + \sqrt{a})(\sqrt{a+1} – \sqrt{a})}\\
& = \frac{\sqrt{a+1} – \sqrt{a}}{(\sqrt{a+1})^2 – (\sqrt{a})^2} \\
& = \frac{\sqrt{a+1} – \sqrt{a}}{(a+1) – a} \\
& = \sqrt{a+1} – \sqrt{a}. \end{aligned}\]
Hence using this formula on each term:
\[ \begin{aligned}
\frac{1}{1 + \sqrt{2}} + \frac{1}{\sqrt{2} + \sqrt{3}}
+ \frac{1}{\sqrt{3} + \sqrt{4}} & = (\sqrt{2} – \sqrt{1}) + (\sqrt{3} – \sqrt{2}) + (\sqrt{4} – \sqrt{3}) \\
& = 1.\end{aligned}\]

We shall return to more examples of bad proofs later!

Posted in Mathematics | Tagged | Leave a comment

Hello World!

This will be the class blog for 16100 in Autumn 2025, and will be an occasional supplement to the regular course lectures. (I started blogging about courses during the pandemic, but students find the blog useful so have continued to use it.)

You should really think about this course as several courses in one. What are those courses?

  1. An introduction to proof. There is an accepted language (with its own vocabulary and grammar) for writing down mathematical proofs. A key part of this course is being able to learn to write down such arguments).
  2. Transitioning from thinking about mathematics as a technique for doing calculations to a theory of why things are true. You probably all did Calculus in high school and got great grades; now you have to unlearn everything you thought you knew. OK, perhaps that is an exaggeration; more accurate is that you will have to learn how much you don’t know and have taken for granted throughout your entire mathematics education. Through the looking glass we go!

    Syllabus: You can find a syllabus here which has some information about grading for the course.

Posted in Uncategorized | 4 Comments