Solved Exercises on Logical Reasoning Strategies in Mathematical Reasoning

Master logical reasoning strategies: proof techniques, conditional statements, logical equivalences, and deductive reasoning through these 5 detailed exercises with comprehensive explanations.

Solution: Exercises 1 to 3
1 Conditional Statements
Exercise 1
Given the conditional statement: "If a number is divisible by 6, then it is divisible by 2 and 3." Write the converse, inverse, and contrapositive. Determine the truth value of each statement.
Key Definition:

Conditional Statement: An "if-then" statement of the form "If p, then q" (p → q). Converse: q → p; Inverse: ¬p → ¬q; Contrapositive: ¬q → ¬p.

Solution Method:
  1. Identify the hypothesis (p) and conclusion (q)
  2. Form the converse by switching p and q
  3. Form the inverse by negating both p and q
  4. Form the contrapositive by negating both and switching
  5. Determine truth values using logical principles
Original
p → q
Converse
q → p
Contrapositive
¬q → ¬p
Step 1: Identify hypothesis and conclusion

Hypothesis (p): A number is divisible by 6

Conclusion (q): It is divisible by 2 and 3

Original statement: p → q

Step 2: Write the converse

Converse: If a number is divisible by 2 and 3, then it is divisible by 6

Symbolically: q → p

Truth value: TRUE (If n is divisible by both 2 and 3, then n is divisible by lcm(2,3)=6)

Step 3: Write the inverse

Inverse: If a number is not divisible by 6, then it is not divisible by 2 and 3

Symbolically: ¬p → ¬q

Truth value: FALSE (Counterexample: 10 is not divisible by 6, but is divisible by 2)

Step 4: Write the contrapositive

Contrapositive: If a number is not divisible by 2 and 3, then it is not divisible by 6

Symbolically: ¬q → ¬p

Truth value: TRUE (Logically equivalent to original statement)

Step 5: Analyze logical relationships

Original ↔ Contrapositive: Logically equivalent

Converse ↔ Inverse: Logically equivalent

Original and Converse: Not necessarily equivalent

Original: True; Converse: True; Inverse: False; Contrapositive: True
Final Answer:

Original: True; Converse: True; Inverse: False; Contrapositive: True

Applied Rules:

• Conditional Logic: p → q is equivalent to ¬q → ¬p

• Converse vs Original: Not logically equivalent

• Counterexamples: Disprove universal statements

2 Proof by Contradiction
Exercise 2
Prove that √2 is irrational using proof by contradiction. Then explain why this method is effective for proving the non-existence of something.
Key Definition:

Proof by Contradiction: A method of proof where we assume the opposite of what we want to prove and show that this leads to a logical contradiction.

Assumption
√2 is rational
Rational Form
√2 = a/b (a,b ∈ ℤ, b≠0)
Contradiction
Both a,b even → gcd(a,b)≥2
Step 1: Assume the opposite

Assume √2 is rational, meaning √2 = a/b where a and b are integers with no common factors (gcd(a,b) = 1) and b ≠ 0.

Step 2: Square both sides

(√2)² = (a/b)²

2 = a²/b²

2b² = a²

Step 3: Analyze the result

Since a² = 2b², a² is even

If a² is even, then a must be even (since odd² = odd)

So a = 2k for some integer k

Step 4: Substitute and continue

a² = (2k)² = 4k²

From 2b² = a²: 2b² = 4k²

Therefore: b² = 2k²

Step 5: Reach contradiction

Since b² = 2k², b² is even

Therefore b is even

But if both a and b are even, then gcd(a,b) ≥ 2

This contradicts our assumption that gcd(a,b) = 1

Step 6: Conclude

Since assuming √2 is rational leads to a contradiction, √2 must be irrational

Step 7: Explain method effectiveness

Proof by contradiction is effective for proving non-existence because:

• It allows us to assume existence and derive impossibility

• It creates a logical framework to explore consequences

• It leverages the principle that contradictory premises lead to absurd conclusions

√2 is irrational (proof by contradiction)
Final Answer:

√2 is irrational. Proof by contradiction is effective because assuming the opposite leads to a logical impossibility, confirming the original statement.

Applied Rules:

• Proof by Contradiction: Assume ¬P, derive contradiction, conclude P

• Even/Odd Properties: Even² = even, Odd² = odd

• Rational Numbers: Can be expressed as a/b in lowest terms

3 Logical Equivalence
Exercise 3
Prove that the statements "If it rains, then the ground gets wet" and "Either it doesn't rain or the ground gets wet" are logically equivalent using truth tables. Then explain the logical principle behind this equivalence.
Key Definition:

Logical Equivalence: Two statements are logically equivalent if they have the same truth values under all possible interpretations.

Statement 1
p → q
Statement 2
¬p ∨ q
Equivalence
p → q ≡ ¬p ∨ q
Step 1: Define variables

Let p = "It rains"

Let q = "The ground gets wet"

Statement 1: p → q (If it rains, then the ground gets wet)

Statement 2: ¬p ∨ q (Either it doesn't rain or the ground gets wet)

Step 2: Construct truth table
p (rains) q (wet) ¬p p → q ¬p ∨ q
T T F T T
T F F F F
F T T T T
F F T T T
Step 3: Compare columns

Columns for (p → q) and (¬p ∨ q) are identical in all rows

Therefore: p → q ≡ ¬p ∨ q

Step 4: Explain logical principle

The equivalence p → q ≡ ¬p ∨ q is based on the fact that:

A conditional statement is false only when the antecedent is true and the consequent is false

In all other cases, the conditional is true

This matches the disjunction ¬p ∨ q: true when p is false OR q is true

Step 5: Interpret in context

"If it rains, then the ground gets wet" is equivalent to saying "Either it doesn't rain or the ground gets wet"

Both statements are false only when it rains but the ground doesn't get wet

Step 6: Note practical implications

This equivalence allows us to convert conditional statements to disjunctions

Useful in formal logic, computer science, and mathematical proofs

p → q ≡ ¬p ∨ q (verified by truth table)
Final Answer:

The statements are logically equivalent. The principle is that a conditional statement is equivalent to the disjunction of the negation of the antecedent with the consequent.

Applied Rules:

• Conditional Equivalence: p → q ≡ ¬p ∨ q

• Truth Tables: Systematic method for proving logical equivalence

• Logical Implication: Only false when true → false

Logical Reasoning Strategies: Laws, Methods, and Principles
\(\text{Logic} = \text{Propositions} + \text{Connectives} + \text{Rules}\)
Logical Framework
Key Definitions:

Proposition: A declarative sentence that is either true or false, but not both.

Logical Connective: Words or symbols that connect propositions (and, or, not, if-then, if and only if).

Valid Argument: An argument where if the premises are true, the conclusion must be true.

Sound Argument: A valid argument with true premises.

Logical Reasoning Process:
  1. Identify Propositions: Determine the basic statements
  2. Recognize Connectives: Identify logical operators
  3. Form Structure: Express in symbolic form
  4. Apply Rules: Use logical equivalences and inference rules
  5. Derive Conclusion: Reach logical conclusion
  6. Verify Validity: Check reasoning process
De Morgan's Laws
¬(p ∧ q) ≡ ¬p ∨ ¬q
¬(p ∨ q) ≡ ¬p ∧ ¬q
Negation of conjunction/disjunction
Conditional
p → q ≡ ¬p ∨ q
p → q ≡ ¬q → ¬p
Implication equivalences
Biconditional
p ↔ q ≡ (p → q) ∧ (q → p)
If and only if equivalence
Tip 1: Always consider all possible truth values when constructing truth tables.
Tip 2: In proof by contradiction, clearly state your assumption.
Tip 3: Remember: p → q is true whenever p is false, regardless of q.
Tip 4: Use counterexamples to disprove universal statements.
Common Applications: Mathematical proofs, computer programming, circuit design, legal reasoning, and scientific methodology.
Key Benefits: Provides rigorous foundation for arguments, eliminates ambiguity, and ensures valid reasoning.
Critical Logical Rules:

• Modus Ponens: If p → q and p, then q

• Modus Tollens: If p → q and ¬q, then ¬p

• Law of Detachment: Valid inference rule for conditionals

• Principle of Contradiction: A statement cannot be both true and false

Solution: Exercises 4 to 5
4 Deductive Reasoning
Exercise 4
Given the following premises: (1) All squares are rectangles. (2) All rectangles have four sides. (3) Figure X is a square. Use deductive reasoning to conclude whether Figure X has four sides. Justify each step using logical principles.
Definition:

Deductive Reasoning: A logical process where conclusions are drawn from general principles or premises. If premises are true, the conclusion must be true.

Premise 1
∀x(S(x) → R(x))
Premise 2
∀x(R(x) → F(x))
Premise 3
S(X)
Step 1: Symbolize the premises

Let S(x) = "x is a square"

Let R(x) = "x is a rectangle"

Let F(x) = "x has four sides"

Premise 1: ∀x(S(x) → R(x)) [All squares are rectangles]

Premise 2: ∀x(R(x) → F(x)) [All rectangles have four sides]

Premise 3: S(X) [Figure X is a square]

Step 2: Apply Universal Instantiation

From Premise 1 and S(X): S(X) → R(X)

Since S(X) is true and S(X) → R(X), by Modus Ponens: R(X) is true

Conclusion: Figure X is a rectangle

Step 3: Apply Universal Instantiation again

From Premise 2: R(X) → F(X)

Since R(X) is true and R(X) → F(X), by Modus Ponens: F(X) is true

Conclusion: Figure X has four sides

Step 4: Apply Hypothetical Syllogism

From S(x) → R(x) and R(x) → F(x), we can deduce: S(x) → F(x)

This means: All squares have four sides

Since S(X) is true, F(X) must be true

Step 5: Verify logical validity

The argument follows valid logical forms:

Universal Instantiation + Modus Ponens + Hypothetical Syllogism

If all premises are true, the conclusion must be true

Step 6: State the final conclusion

Yes, Figure X has four sides.

Justification: Figure X is a square → Figure X is a rectangle → Figure X has four sides

Yes, Figure X has four sides (deductively proven)
Final Answer:

Yes, Figure X has four sides. This follows deductively from the premises using valid logical rules: Universal Instantiation, Modus Ponens, and Hypothetical Syllogism.

Applied Rules:

• Universal Instantiation: From ∀x P(x), infer P(c) for any c

• Modus Ponens: From p → q and p, infer q

• Hypothetical Syllogism: From p → q and q → r, infer p → r

5 Proof by Induction
Exercise 5
Prove by mathematical induction that for all positive integers n: 1 + 2 + 3 + ... + n = n(n+1)/2. Explain why this method of proof is valid for statements about all positive integers.
Definition:

Mathematical Induction: A proof technique for statements about all positive integers, consisting of a base case and an inductive step.

Base Case
n=1: 1 = 1(2)/2
Inductive Hypothesis
1+...+k = k(k+1)/2
Inductive Step
1+...+(k+1) = (k+1)(k+2)/2
Step 1: State what we want to prove

P(n): 1 + 2 + 3 + ... + n = n(n+1)/2 for all positive integers n

Step 2: Prove the base case (n = 1)

Left side: 1

Right side: 1(1+1)/2 = 1(2)/2 = 1

Since both sides equal 1, P(1) is true

Step 3: State the inductive hypothesis

Assume P(k) is true for some arbitrary positive integer k:

1 + 2 + 3 + ... + k = k(k+1)/2

Step 4: Prove the inductive step

We must show that P(k+1) is true:

1 + 2 + 3 + ... + k + (k+1) = (k+1)((k+1)+1)/2

Step 5: Use the inductive hypothesis

Starting with the left side of P(k+1):

1 + 2 + 3 + ... + k + (k+1) = [1 + 2 + 3 + ... + k] + (k+1)

By inductive hypothesis: = k(k+1)/2 + (k+1)

Step 6: Simplify the expression

k(k+1)/2 + (k+1) = k(k+1)/2 + 2(k+1)/2

= [k(k+1) + 2(k+1)]/2

= [(k+1)(k + 2)]/2

= (k+1)(k+2)/2

Step 7: Complete the inductive step

We've shown that if P(k) is true, then P(k+1) is true

Since P(1) is true and P(k) → P(k+1), by mathematical induction,

P(n) is true for all positive integers n

Step 8: Explain validity of induction

Mathematical induction is valid because:

• The base case establishes the statement for n=1

• The inductive step shows that truth propagates from any n=k to n=k+1

• Together, they establish truth for n=1, 2, 3, ..., covering all positive integers

1+2+...+n = n(n+1)/2 (proven by induction)
Final Answer:

The formula 1 + 2 + 3 + ... + n = n(n+1)/2 is proven true for all positive integers n by mathematical induction. This method works because it establishes a domino effect of truth across all positive integers.

Applied Rules:

• Mathematical Induction: Base case + inductive step proves universal statement

• Algebraic Manipulation: Factoring and simplification techniques

• Logical Structure: If P(1) and P(k)→P(k+1), then P(n) for all n≥1

Logical Reasoning Strategies Guide: Comprehensive Summary
\(\text{Validity} = \text{Premises} \rightarrow \text{Conclusion}\)
Logical Validity Framework
Key definitions:

Logical Reasoning: The process of using a rational, systematic series of steps based on sound mathematical procedures and given statements to arrive at a conclusion.

Deductive Reasoning: Drawing specific conclusions from general principles; if premises are true, conclusion must be true.

Inductive Reasoning: Drawing general conclusions from specific observations; conclusion is probable but not certain.

Mathematical Induction: A proof technique establishing truth for all positive integers through base case and inductive step.

Complete Logical Reasoning Methodology:
  1. Proposition Identification: Recognize and symbolize the basic statements
  2. Structure Analysis: Determine the logical form and relationships
  3. Rule Selection: Choose appropriate logical rules and equivalences
  4. Argument Construction: Build a step-by-step logical progression
  5. Validity Verification: Check each step follows logically
  6. Conclusion Drawing: Reach the final logical result
  7. Soundness Check: Ensure premises are true for practical application
Tip 1: Always distinguish between validity (formal correctness) and soundness (validity + true premises).
Tip 2: In conditional statements, remember that false antecedents make the whole statement true.
Tip 3: For proof by contradiction, clearly mark your assumption and the contradiction reached.
Tip 4: In mathematical induction, verify both base case and inductive step carefully.
Common Applications: Mathematical proofs, computer algorithms, circuit design, legal arguments, scientific theories, and decision-making processes.
Logical Patterns: Modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, and constructive dilemma.
Essential Logical Principles:

• Law of Identity: A = A; every statement is identical to itself

• Law of Non-Contradiction: A and ¬A cannot both be true

• Law of Excluded Middle: Either A or ¬A must be true

• Transitivity: If A implies B and B implies C, then A implies C

Logical Reasoning Approaches: Comparative Analysis
Different Logical Methods
Various logical reasoning strategies serve different purposes:
Deductive reasoning: Draws specific conclusions from general principles
Inductive reasoning: Derives general principles from specific instances
Proof by contradiction: Assumes negation to reach contradiction
Mathematical induction: Proves statements for all positive integers

Analysis: This chart illustrates the applicability and certainty of different logical reasoning approaches.

  • Deductive reasoning provides certainty when premises are true
  • Inductive reasoning offers probability based on evidence
  • Proof by contradiction is effective for negative claims
  • Mathematical induction handles infinite sets systematically

Questions & Answers

Question: I'm confused about when to use proof by contradiction versus direct proof. How do I decide which approach to use?

Answer: Here are guidelines for choosing between proof methods:

  • Direct Proof: Use when you can build a logical chain from premises to conclusion step by step
  • Proof by Contradiction: Use when the statement is negative (e.g., "there is no...") or when assuming the opposite leads to obvious contradictions
  • Proof by Contrapositive: Use when the contrapositive seems easier to prove than the original statement
  • Pattern Recognition: Irrationality proofs, uniqueness statements, and non-existence claims often work well with contradiction

For example, proving √2 is irrational is difficult directly, but assuming it's rational leads to the contradiction that both numerator and denominator are even (violating lowest terms). However, proving (a+b)² = a² + 2ab + b² is easily done by direct expansion.

Start with direct proof; if you get stuck or see a potential contradiction path, consider contradiction. Experience will develop intuition for which method works best.

Question: Why is mathematical induction valid? It feels like we're just assuming what we want to prove.

Answer: Mathematical induction is valid because of its logical structure, not because we assume what we want to prove:

  • What We Actually Assume: In the inductive step, we assume P(k) is true for some arbitrary k, then prove P(k+1) follows
  • The Domino Effect: Base case (P(1) true) + inductive step (P(k)→P(k+1)) creates an infinite chain: P(1)→P(2)→P(3)→...
  • Logical Foundation: This relies on the well-ordering principle of natural numbers
  • Not Circular: We're not assuming P(n) for all n; we're proving that if P(k) holds, then P(k+1) must also hold

Think of it like a ladder: we verify we can stand on the first rung (base case), then prove that if we can reach any rung k, we can also reach rung k+1. This guarantees we can climb to any rung.

The inductive hypothesis is a conditional assumption ("IF P(k), THEN..."), not an assertion of truth for all values.

Question: What's the difference between a valid argument and a sound argument? Can you give examples of each?

Answer: Here are the key distinctions:

  • Valid Argument: The conclusion follows logically from the premises, regardless of whether the premises are true
  • Sound Argument: A valid argument with all true premises

Example of Valid but Unsound Argument:

Premise 1: All birds can fly

Premise 2: Penguins are birds

Conclusion: Therefore, penguins can fly

This argument is valid (follows logical form) but unsound (first premise is false).

Example of Sound Argument:

Premise 1: All humans are mortal

Premise 2: Socrates is a human

Conclusion: Therefore, Socrates is mortal

This argument is both valid (correct logical form) and sound (true premises).

In mathematics, we typically seek both validity and truth of premises to ensure sound arguments.