Welcome to the Art of Problem Solving: Considering Cases
In your H3 Mathematics journey, you will often encounter problems that look incredibly daunting at first glance. They might seem too general or involve variables that could be "anything." This is where Problem Solving Heuristics come in, and one of the most powerful tools in your toolkit is Considering Cases.
Think of "Considering Cases" like planning a trip. You can't just pack one outfit and hope for the best. Instead, you think: "What if it rains? What if it's sunny? What if it's snowing?" By breaking the big problem (traveling) into smaller scenarios (weather types), you can handle each one perfectly. In math, we do exactly the same thing!
What is "Considering Cases"?
Considering Cases is a heuristic where you break a single, complex problem into several smaller, simpler sub-problems. Each sub-problem represents a specific scenario or "case." Once you solve all the individual cases, you have effectively solved the entire problem.
For this to work effectively, your cases must be:
- Exhaustive: You haven't missed any possibilities. Every possible scenario must fit into at least one of your cases.
- Mutually Exclusive (Ideally): Your cases shouldn't overlap. This makes your work cleaner and prevents "double-counting" in probability or counting problems.
Quick Review: Think of the set of all integers. If we split them into "Even" and "Odd," we have covered every single integer (exhaustive) and no integer is both (mutually exclusive). That's a perfect set of cases!
Common Ways to Split Cases
Don't worry if you aren't sure how to start splitting a problem. Here are some "classic" ways to consider cases that appear frequently in the H3 syllabus:
1. Parity (Even vs. Odd)
When dealing with integers \( n \), the behavior of an expression often changes depending on whether \( n \) is even or odd.
Example: To prove that \( n^2 + n \) is always even, consider Case 1: \( n = 2k \) (even) and Case 2: \( n = 2k + 1 \) (odd).
2. Signs (Positive, Negative, or Zero)
This is essential when dealing with inequalities or absolute values.
Example: For the expression \( |x - 3| \), you would consider Case 1: \( x \geq 3 \) (where the expression is \( x - 3 \)) and Case 2: \( x < 3 \) (where the expression is \( -(x - 3) \)).
3. Modular Arithmetic (Remainders)
Sometimes "Even vs. Odd" isn't enough. You might need to look at remainders when dividing by other numbers (congruence classes).
Example: If a problem involves \( n^2 \), you might look at cases for \( n \) modulo 3: \( n \equiv 0 \), \( n \equiv 1 \), or \( n \equiv 2 \pmod{3} \).
4. Relative Sizes
In inequalities involving multiple variables like \( a, b, \) and \( c \), it often helps to assume an order.
Example: "Assume without loss of generality (WLOG) that \( a \leq b \leq c \)." This uses the Symmetry Principle to reduce the number of cases you need to check!
Step-by-Step: How to Use the Heuristic
When you're stuck on a problem, follow these steps to apply the "Considering Cases" strategy:
Step 1: Identify the "Splitter." Look for a part of the problem that behaves differently in different situations (like an absolute value sign or an integer variable).
Step 2: Define your cases clearly. Write them down! "Case 1: \( n \) is even." This keeps your thoughts organized and helps the examiner follow your logic.
Step 3: Solve each case individually. Treat each case as its own mini-problem. Use the specific information of that case (e.g., "In this case, I know \( x \) is negative") to simplify the equations.
Step 4: Summarize the results. Look at what you've found across all cases. Does the result hold true for every case? If so, you've proved your point!
A Simple Example in Action
Problem: Prove that for any integer \( n \), the expression \( n^2 + 3n + 5 \) is always odd.
Case 1: \( n \) is even.
Let \( n = 2k \) for some integer \( k \).
\( n^2 + 3n + 5 = (2k)^2 + 3(2k) + 5 \)
\( = 4k^2 + 6k + 4 + 1 \)
\( = 2(2k^2 + 3k + 2) + 1 \)
Since this is in the form \( 2m + 1 \), it is odd.
Case 2: \( n \) is odd.
Let \( n = 2k + 1 \) for some integer \( k \).
\( n^2 + 3n + 5 = (2k+1)^2 + 3(2k+1) + 5 \)
\( = (4k^2 + 4k + 1) + (6k + 3) + 5 \)
\( = 4k^2 + 10k + 9 \)
\( = 4k^2 + 10k + 8 + 1 \)
\( = 2(2k^2 + 5k + 4) + 1 \)
Since this is also in the form \( 2m + 1 \), it is odd.
Conclusion: Since the expression is odd in all possible cases, it is always odd. Q.E.D.
Did you know?
The famous Four Color Theorem (which states that any map can be colored with just four colors so that no two adjacent regions share a color) was proven using "Considering Cases." However, there were so many cases (nearly 2,000!) that mathematicians had to use a computer to check them all. This was the first major theorem to be proved using a computer!
Common Pitfalls to Avoid
Even though this technique is simple, it's easy to make these mistakes:
- The "Missing Piece" Trap: Forgetting a case. If you check \( x > 0 \) and \( x < 0 \), you must remember to check \( x = 0 \)!
- Overcomplicating: Creating 10 cases when 2 would have worked. Always look for the most efficient way to split the problem.
- Losing the Big Picture: Getting so caught up in solving Case 1 that you forget what the original question was asking. Always refer back to the main goal.
Key Takeaways
- Break it down: If a problem is too broad, chop it into smaller, manageable scenarios.
- Be exhaustive: Ensure your cases cover every single possibility allowed by the problem.
- Use structure: Clearly label your cases to stay organized and score maximum marks for clarity.
- Practice "Splitter" recognition: The more problems you do, the faster you'll spot when to use parity, signs, or modular arithmetic.
Don't worry if this seems tricky at first! Problem-solving is a skill that grows with practice. The next time you see a variable \( n \), ask yourself: "What happens if \( n \) is small? What happens if it's even?" You're already considering cases!