Solved Exercises on Logical Reasoning Strategies in Grade 8

Master logical reasoning with strategies: working backwards, pattern recognition, systematic listing, elimination, and counterexamples through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Working Backwards Strategy
Exercise 1
John thinks of a number. He multiplies it by 3, adds 7, divides by 2, and gets 11. What was his original number?
Definition:

Working backwards: Starting from the final result and reversing operations to find the initial value.

Working backwards method:
  1. Start with the final result
  2. Reverse each operation in reverse order
  3. Perform inverse operations (multiply ↔ divide, add ↔ subtract)
  4. Verify the answer by going forward
Step 1: Write the sequence of operations

Start → ×3 → +7 → ÷2 → 11 (final result)

Step 2: Reverse operations in reverse order

11 → ×2 → -7 → ÷3 → Start

Step 3: Calculate step by step

11 × 2 = 22

22 - 7 = 15

15 ÷ 3 = 5

Step 4: Verify the answer

Start with 5: 5 × 3 = 15, 15 + 7 = 22, 22 ÷ 2 = 11 ✓

The original number was 5
Final answer:

The original number was 5

Applied rules:

• 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

2 Pattern Recognition Strategy
Exercise 2
Find the next three terms in the sequence: 2, 5, 10, 17, 26, ...
Definition:

Pattern recognition: Identifying the rule governing a sequence of numbers or figures.

Step 1: Look at the differences between consecutive terms

5 - 2 = 3

10 - 5 = 5

17 - 10 = 7

26 - 17 = 9

Differences: 3, 5, 7, 9 (odd numbers increasing by 2)

Step 2: Identify the pattern in differences

3, 5, 7, 9 are consecutive odd numbers

Next differences: 11, 13, 15

Step 3: Calculate next terms

26 + 11 = 37

37 + 13 = 50

50 + 15 = 65

Step 4: Verify the pattern

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
Final answer:

Next three terms: 37, 50, 65

Applied rules:

• 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

3 Systematic Listing Strategy
Exercise 3
How many 3-digit numbers can be formed using the digits 1, 2, 3, 4, 5 without repetition?
Definition:

Systematic listing: Organizing possibilities in a structured way to count all outcomes without missing any or counting duplicates.

Step 1: Identify constraints

3-digit number: positions H (hundreds), T (tens), U (units)

Digits available: 1, 2, 3, 4, 5

No repetition allowed

Step 2: Apply the counting principle

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)

Step 3: Calculate total possibilities

Total = 5 × 4 × 3 = 60 numbers

Step 4: Verify with systematic listing

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
Final answer:

60 different 3-digit numbers can be formed

Applied rules:

• 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

Rules and methods, laws,...
Logic = Premises → Conclusion
Logical Reasoning Framework
Working Backwards
Final Result → Inverse Operations → Initial Value
Solving problems by reversing operations
Pattern Recognition
Sequence → Differences → Formula
Finding rules in number sequences
Systematic Listing
Total = Choices₁ × Choices₂ × ...
Counting principle applications
Key definitions:

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)

Complete methodology:
  1. Understand the problem: Identify what is being asked
  2. Choose the strategy: Select appropriate logical reasoning method
  3. Execute the plan: Apply the chosen strategy systematically
  4. Verify the solution: Check if the answer makes sense
Tip 1: When stuck, try a different strategy or re-read the problem carefully.
Tip 2: Use tables or diagrams to organize information systematically.
Tip 3: Always verify your solution by substituting back into the original problem.
Benefits: Logical reasoning strategies improve problem-solving efficiency, reduce guesswork, and build critical thinking skills.
Applications: Word problems, puzzles, geometry proofs, algebraic equations, and real-world decision making.
Solution: Exercises 4 to 5
4 Elimination Strategy
Exercise 4
Four people - Alice, Bob, Carol, and Dave - are sitting around a table. We know: (1) Alice is not next to Bob, (2) Carol is next to Alice, (3) Dave is not opposite Alice. Who sits across from Bob?
Definition:

Elimination strategy: Systematically removing impossible options until only the correct solution remains.

Position 1 2 3 4
Opposite 3 4 1 2
Step 1: Analyze constraint (1) - Alice is not next to Bob

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

Step 2: Apply constraint (2) - Carol is next to Alice

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

Step 3: Apply constraint (3) - Dave is not opposite Alice

If Alice is at position 1, Dave cannot be at position 3

If Alice is at position 2, Dave cannot be at position 4

Step 4: Test possible arrangements systematically

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
Final answer:

Dave sits across from Bob

Applied rules:

• Constraint satisfaction: Every condition must be met simultaneously

• Systematic testing: Try all possible arrangements methodically

• Verification: Check each constraint against the final solution

5 Counterexample Strategy
Exercise 5
Is the statement "For any integer n, n² > n" always true? Provide a counterexample if it's false.
Definition:

Counterexample: A specific example that proves a general statement is false.

Step 1: Understand the statement

n² > n for all integers n

Step 2: Test various integer values

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

Step 3: Identify counterexamples

When n = 0: n² = 0, and 0 > 0 is FALSE

When n = 1: n² = 1, and 1 > 1 is FALSE

Step 4: Conclude

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
Final answer:

The statement is false. Counterexamples: n = 0 and n = 1

Applied rules:

• 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

Summary: Logical Reasoning Strategies in Mathematical Problem Solving
Reasoning = Premises + Logic → Valid Conclusion
Logical Reasoning Framework
Key definitions:

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).

Core logical reasoning strategies:
  1. Working backwards: Starting from the desired outcome and reversing operations to find the initial state.
  2. Pattern recognition: Identifying regularities in sequences, shapes, or relationships.
  3. Systematic listing: Organizing possibilities in a structured way to ensure completeness.
  4. Elimination: Removing impossible options until only viable solutions remain.
  5. Counterexample: Providing a specific instance that disproves a general statement.
Tip 1: Always verify your logical arguments by checking if conclusions follow from premises.
Tip 2: Use truth tables to evaluate complex logical statements systematically.
Tip 3: Break complex problems into smaller, manageable logical steps.
Tip 4: Practice identifying assumptions in logical arguments.
Common logical fallacies: Affirming the consequent, denying the antecedent, circular reasoning, hasty generalization.
Key principles: Consistency (no contradictions), validity (conclusion follows from premises), soundness (valid argument with true premises).
Logical connective truth tables:
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

Working Backwards Strategy
This strategy involves starting with the final result and reversing operations to find the initial value.

Example: If x + 5 = 12, then x = 12 - 5 = 7

Application: Multi-step equations, word problems with sequential operations

Pattern Recognition Strategy
This strategy involves identifying regularities in sequences, shapes, or relationships.

Example: Sequence 2, 4, 8, 16... follows the pattern 2ⁿ

Application: Number sequences, geometric patterns, algebraic expressions

Systematic Listing Strategy
This strategy involves organizing possibilities in a structured way to ensure completeness.

Example: Counting permutations: n! for arranging n distinct items

Application: Combinatorics, probability, counting problems

Elimination Strategy
This strategy involves removing impossible options until only viable solutions remain.

Example: Sudoku puzzle solving, multiple-choice questions

Application: Logic puzzles, constraint satisfaction problems

Counterexample Strategy
This strategy involves providing a specific instance that disproves a general statement.

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:

  1. It must be within the domain: The counterexample must satisfy all the conditions specified in the hypothesis of the statement.
  2. 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.