Working backwards: Starting from the final result and reversing operations to find the initial value.
- Start with the final result
- Reverse each operation in reverse order
- Perform inverse operations (multiply ↔ divide, add ↔ subtract)
- Verify the answer by going forward
Start → ×3 → +7 → ÷2 → 11 (final result)
11 → ×2 → -7 → ÷3 → Start
11 × 2 = 22
22 - 7 = 15
15 ÷ 3 = 5
Start with 5: 5 × 3 = 15, 15 + 7 = 22, 22 ÷ 2 = 11 ✓
The original number was 5
• Inverse operations: Addition is inverse of subtraction, multiplication is inverse of division
• Order reversal: Operations are reversed in opposite order
• Verification: Always check by performing original operations
Pattern recognition: Identifying the rule governing a sequence of numbers or figures.
5 - 2 = 3
10 - 5 = 5
17 - 10 = 7
26 - 17 = 9
Differences: 3, 5, 7, 9 (odd numbers increasing by 2)
3, 5, 7, 9 are consecutive odd numbers
Next differences: 11, 13, 15
26 + 11 = 37
37 + 13 = 50
50 + 15 = 65
Alternative pattern: n² + 1 (where n starts at 1)
1² + 1 = 2, 2² + 1 = 5, 3² + 1 = 10, 4² + 1 = 17, 5² + 1 = 26
6² + 1 = 37, 7² + 1 = 50, 8² + 1 = 65 ✓
Next three terms: 37, 50, 65
• Difference analysis: Look for patterns in differences between terms
• Second differences: If first differences aren't constant, look at differences of differences
• Formula recognition: Try to express terms as functions of position
Systematic listing: Organizing possibilities in a structured way to count all outcomes without missing any or counting duplicates.
3-digit number: positions H (hundreds), T (tens), U (units)
Digits available: 1, 2, 3, 4, 5
No repetition allowed
Hundreds place: 5 choices (any of 1,2,3,4,5)
Tens place: 4 choices (remaining after hundreds)
Units place: 3 choices (remaining after hundreds and tens)
Total = 5 × 4 × 3 = 60 numbers
Starting with 1: 123, 124, 125, 132, 134, 135, 142, 143, 145, 152, 153, 154 (12 numbers)
Similarly for 2, 3, 4, 5: 12 each → Total = 5 × 12 = 60 ✓
60 different 3-digit numbers can be formed
• Counting principle: If one event has m outcomes and another has n outcomes, together they have m × n outcomes
• Permutation: Arrangements without repetition: P(n,r) = n!/(n-r)!
• Systematic organization: Group by first digit to ensure no omissions
Logical reasoning: The process of using rational thinking to analyze information and reach conclusions
Proposition: A statement that is either true or false
Conjunction: "AND" operation (both conditions must be true)
Disjunction: "OR" operation (at least one condition must be true)
- Understand the problem: Identify what is being asked
- Choose the strategy: Select appropriate logical reasoning method
- Execute the plan: Apply the chosen strategy systematically
- Verify the solution: Check if the answer makes sense
Elimination strategy: Systematically removing impossible options until only the correct solution remains.
| Position | 1 | 2 | 3 | 4 |
|---|---|---|---|---|
| Opposite | 3 | 4 | 1 | 2 |
If Alice is at position 1, Bob cannot be at positions 2 or 4
If Alice is at position 2, Bob cannot be at positions 1 or 3
And so on for all positions
If Alice is at position 1, Carol must be at position 2 or 4
If Alice is at position 2, Carol must be at position 1 or 3
If Alice is at position 1, Dave cannot be at position 3
If Alice is at position 2, Dave cannot be at position 4
Try Alice at position 1:
Carol must be at 2 or 4, Bob cannot be at 2 or 4, Dave cannot be at 3
Possible: Alice(1), Carol(2), Bob(3), Dave(4) - Check: Alice not next to Bob ✓, Carol next to Alice ✓, Dave not opposite Alice ✓
Bob is at position 3, opposite to position 1 (Alice) - Wait, this violates constraint (3)
Correct: Alice(1), Carol(4), Bob(3), Dave(2) - Check: Alice not next to Bob ✓, Carol next to Alice ✓, Dave not opposite Alice ✓
Dave sits across from Bob
• Constraint satisfaction: Every condition must be met simultaneously
• Systematic testing: Try all possible arrangements methodically
• Verification: Check each constraint against the final solution
Counterexample: A specific example that proves a general statement is false.
n² > n for all integers n
n = 1: 1² = 1, and 1 > 1 is FALSE
n = 0: 0² = 0, and 0 > 0 is FALSE
n = -1: (-1)² = 1, and 1 > -1 is TRUE
n = 2: 2² = 4, and 4 > 2 is TRUE
When n = 0: n² = 0, and 0 > 0 is FALSE
When n = 1: n² = 1, and 1 > 1 is FALSE
Since we found at least one value (in fact, two) where n² is not greater than n, the statement is false.
The statement is false. Counterexamples: n = 0 and n = 1
• Universal quantifier: To disprove "for all", only one counterexample is needed
• Test boundary values: Check 0, 1, -1, small positive/negative integers
• Logical negation: Finding one exception disproves a universal claim
Logical reasoning: The systematic process of using rational thinking to analyze information, identify patterns, and draw valid conclusions.
Proposition: A declarative statement that is either true or false, but not both.
Truth value: The designation of a proposition as true (T) or false (F).
Logical connectives: Words or symbols that connect propositions (AND, OR, NOT, IF...THEN).
- Working backwards: Starting from the desired outcome and reversing operations to find the initial state.
- Pattern recognition: Identifying regularities in sequences, shapes, or relationships.
- Systematic listing: Organizing possibilities in a structured way to ensure completeness.
- Elimination: Removing impossible options until only viable solutions remain.
- Counterexample: Providing a specific instance that disproves a general statement.
| P | Q | P ∧ Q | P ∨ Q | ¬P | P → Q |
|---|---|---|---|---|---|
| T | T | T | T | F | T |
| T | F | F | T | F | F |
| F | T | F | T | T | T |
| F | F | F | F | T | T |
Where ∧ = AND, ∨ = OR, ¬ = NOT, → = IF...THEN
Example: If x + 5 = 12, then x = 12 - 5 = 7
Application: Multi-step equations, word problems with sequential operations
Example: Sequence 2, 4, 8, 16... follows the pattern 2ⁿ
Application: Number sequences, geometric patterns, algebraic expressions
Example: Counting permutations: n! for arranging n distinct items
Application: Combinatorics, probability, counting problems
Example: Sudoku puzzle solving, multiple-choice questions
Application: Logic puzzles, constraint satisfaction problems
Example: Statement "All prime numbers are odd" is false because 2 is prime and even
Application: Proving statements false, mathematical proofs
Questions & Answers
Question: I often get confused between the different logical reasoning strategies. How do I know which one to use for a particular problem?
Answer: Great question! Here's a decision guide for choosing the right strategy:
- Working backwards: Use when you know the final result and need to find the starting value. Look for problems that describe a sequence of operations ending with a known result.
- Pattern recognition: Use when you see a sequence of numbers, shapes, or events. Look for problems asking "what comes next" or "find the rule".
- Systematic listing: Use when counting possibilities or listing all outcomes. Look for problems asking "how many ways" or "list all possibilities".
- Elimination: Use when you have multiple options and constraints that rule out some possibilities. Look for logic puzzles or problems with multiple conditions.
- Counterexample: Use when trying to prove a statement false or when someone claims something is always true.
Sometimes, you might need to combine strategies. For example, in pattern recognition, you might use systematic listing to explore possibilities before recognizing the pattern.
Question: In the elimination strategy, how do I make sure I haven't missed any possibilities? Sometimes I feel like I might have overlooked a solution.
Answer: This is a very important concern! Here are techniques to ensure completeness in elimination:
- Organize systematically: List all possibilities in a logical order (alphabetical, numerical, by category).
- Use tables or grids: Create a matrix to track which possibilities have been eliminated.
- Count your options: Before starting, determine how many total possibilities exist.
- Verify your solution: Once you find an answer, substitute it back into the original conditions to ensure it satisfies all requirements.
- Consider edge cases: Don't forget unusual or boundary values that might satisfy the conditions.
For example, if you're told four people sit around a table with certain restrictions, start by fixing one person's position and systematically arrange others while checking constraints.
Question: I'm still confused about counterexamples. How do I know if I've found a good one? Could I accidentally use a wrong counterexample?
Answer: Excellent question! A good counterexample must satisfy two criteria:
- It must be within the domain: The counterexample must satisfy all the conditions specified in the hypothesis of the statement.
- It must contradict the conclusion: When you apply the counterexample, the conclusion of the statement must be false.
Example: For the statement "If n is a positive integer, then n² > n," a good counterexample is n = 1 because:
- 1 is a positive integer (satisfies the condition)
- 1² = 1, and 1 is not greater than 1 (contradicts the conclusion)
Common mistake: Using a value that doesn't meet the initial conditions. For example, using n = -1 for the above statement would be incorrect because -1 is not a positive integer.
Always double-check that your counterexample fits within the stated conditions but makes the conclusion false.