Restating the problem (e.g., contrapositive)

Welcome to Problem Solving: The Art of Perspective!

Have you ever spent hours staring at a math problem, feeling like you're running head-first into a brick wall? In H3 Mathematics, the problems are designed to be challenging, but they always have a "secret door." One of the most powerful ways to find that door is a heuristic called Restating the Problem.

Think of it like this: If you can't see what's over a tall fence, you could try to jump (the hard way), or you could just find a ladder or look through a gap. Restating the problem is about changing the "language" or "direction" of the question to make the solution obvious. We will focus specifically on using the contrapositive and other logical restatements to break down these barriers.

Quick Review: Before we dive in, remember that in H3, we often work with statements in the form "If P, then Q" (written as \( P \implies Q \)). P is your starting information (hypothesis), and Q is what you want to prove (conclusion).

1. The Power of the Contrapositive

The contrapositive is the most famous way to restate a problem. Every logical statement \( P \implies Q \) is logically identical to its contrapositive: \( \neg Q \implies \neg P \).

In plain English: "If P is true, then Q must be true" means exactly the same thing as "If Q is NOT true, then P CANNOT be true."

Why use it?

Sometimes, proving something "directly" is messy because the starting point \( P \) doesn't give you much to work with. However, the "negation" of the conclusion (\( \neg Q \)) might give you a much stronger starting point.

Analogy: The Rain and the Grass
Statement: "If it is raining (\( P \)), then the grass is wet (\( Q \))."
Contrapositive: "If the grass is NOT wet (\( \neg Q \)), then it is NOT raining (\( \neg P \))."
Both sentences tell you the exact same thing about the world!

Step-by-Step: How to restate as a Contrapositive

1. Identify your P (the "If" part) and your Q (the "Then" part).
2. Negate both: Find the opposite of \( P \) and the opposite of \( Q \).
3. Swap them: Put the "Not Q" at the front and the "Not P" at the end.
4. Prove the new statement instead!

Example: Prove that for any integer \( n \), if \( n^2 \) is even, then \( n \) is even.
Direct way: Starting with "\( n^2 = 2k \)" is hard because taking the square root \(\sqrt{2k}\) is ugly.
Contrapositive way: Restate it as "If \( n \) is not even (meaning \( n \) is odd), then \( n^2 \) is not even (meaning \( n^2 \) is odd)."
The Proof: If \( n = 2k + 1 \), then \( n^2 = (2k+1)^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1 \), which is clearly odd! Problem solved.

Key Takeaway: If a direct proof feels like you are "working in the dark," try the contrapositive. It often turns "not knowing much" into "having a concrete equation to work with."

2. Avoiding the "Converse" Trap

Don't worry if you get these mixed up at first—many students do! It is very important to distinguish the contrapositive from the converse.

The Converse of \( P \implies Q \) is \( Q \implies P \).
Warning: The converse is NOT necessarily true! Just because the grass is wet doesn't mean it rained (maybe someone used a sprinkler). Proving the converse does not prove your original problem.

Did you know?
The Inverse (\( \neg P \implies \neg Q \)) is also not logically equivalent to the original statement. Only the Contrapositive is a perfectly safe "restatement" that always keeps the same truth value.

3. Restating Using Negation and Contradiction

Sometimes restating the problem involves looking at what happens if the goal is impossible. This is closely related to Proof by Contradiction.

When you restate a problem for contradiction, you are essentially saying:
"Instead of proving P is true, I will show that if P were false, the universe would stop making sense (a contradiction)."

Common Restatement Trick:
To prove "There is no largest prime number," restate it as: "Assume there is a largest prime number \( L \), and show this leads to a mathematical 'explosion'."

Quick Review Box:
Direct: \( P \implies Q \)
Contrapositive (Equivalent): \( \neg Q \implies \neg P \)
Contradiction: Assume \( P \) and \( \neg Q \), then find a mistake.

4. Restating via Complementary Counting (Combinatorics)

In the H3 syllabus, "Restating the Problem" also appears in counting and probability. If a problem asks you to find the number of ways something can happen, it is often easier to restate it as: "Total ways minus the ways it CANNOT happen."

Example: "Find the number of 5-letter arrangements where there is at least one vowel."
Hard way: Count 1 vowel, 2 vowels, 3 vowels, 4 vowels, and 5 vowels, then add them up.
Restated way: Total arrangements minus arrangements with zero vowels.
This is a "restatement" because you've changed the goal from a complex sum to a simple subtraction.

5. Working with Quantifiers: "For all" vs "There exists"

When restating problems involving quantifiers (symbols like \( \forall \) for "for all" and \( \exists \) for "there exists"), the rules of negation are key.

1. The negation of "For all \( x \), \( P(x) \) is true" is "There exists at least one \( x \) where \( P(x) \) is false."
2. The negation of "There exists an \( x \) where \( P(x) \) is true" is "For all \( x \), \( P(x) \) is false."

Analogy:
To disprove the statement "Every student in this room has a pen," you don't need to check everyone's bag—you just need to find one student without a pen. Restating the problem as a search for a counterexample is a classic H3 heuristic.

Key Takeaway: If a problem asks you to prove something is "always" true and you're stuck, try restating it: "What would a single case where this fails look like?" If you can prove such a case is impossible, you've proved the "always" part!

6. Summary Checklist for the Exam

When you see a difficult H3 problem, ask yourself these "Restatement" questions:

• Can I use the Contrapositive? (Would knowing the "opposite" of the conclusion give me a better starting equation?)
• Is there a Complement? (Is it easier to count what I don't want and subtract it from the total?)
• Can I use Contradiction? (What happens if I assume the conclusion is false?)
• Am I trapped by the Converse? (Check: Am I accidentally trying to prove \( Q \implies P \) instead of \( P \implies Q \)?!)

Don't worry if this seems tricky at first! Logical restatement is a skill that grows with practice. Every time you find yourself stuck, take a deep breath and ask: "Is there another way to say this?"