Question

jeff assumes that the opposite of what he is trying to prove is true.

Answer 1

Hello @LorKevo ! Welcome to QuestionCove!

There are many ways to prove something in math, I will attach a picture that describes the kind you are looking for

Answer 2

We have: https://medium.com/@nissim.lavy/types-of-proofs-c43ffacc8ada
Proof by Construction
Proof by Contradiction
and
Proof by Induction

Answer 3

The steps to a Proof by Construction are:
1. Assume that P is true.
2. Use P to show that Q must be true.

The idea behind a Proof by Contradiction is:
Assuming the theorem is false, and then show that the assumption is false itself, and is therefore a contradiction.

Then a Proof by Induction is:
Assuming that the starting situation (n) is true and to prove that it is true for every n+1 case

Answer 4

This should be enough information to help you choose which type of proving method "jeff" in your problem is trying.

Let me know if you are still stuck! @LorKevo