Deductive Reasoning: Drawing specific conclusions from general principles or premises
Inductive Reasoning: Drawing general conclusions from specific examples or patterns
Logical Implication: If P is true, then Q must be true (P → Q)
Contrapositive: If not Q, then not P (¬Q → ¬P), equivalent to original implication
Counterexample: Specific case that disproves a general statement
Proof by Contradiction: Assume the opposite of what you want to prove and show it leads to contradiction
Logical Connectives: Words like "and", "or", "not", "if...then" that connect statements
- Identify Premises: List all given facts and assumptions
- Determine Goal: Clearly state what you need to prove or conclude
- Choose Strategy: Decide between deductive or inductive reasoning
- Apply Logic: Use valid reasoning patterns and rules
- Check Validity: Ensure each step follows logically from previous ones
- Verify Conclusion: Confirm your conclusion is supported by your reasoning
- Communicate Clearly: Present your reasoning in an organized manner
Deductive Reasoning: Starting with general principles and applying them to specific cases
- State the given premises
- Apply logical rules to derive intermediate conclusions
- Reach the final conclusion
- Verify each step is logically valid
Premise 1: All squares are rectangles
Premise 2: All rectangles have four right angles
Premise 3: ABCD is a square
Since ABCD is a square (Premise 3) and all squares are rectangles (Premise 1), then ABCD is a rectangle
Since ABCD is a rectangle (from Step 2) and all rectangles have four right angles (Premise 2), then ABCD has four right angles
Therefore, ABCD has four right angles
Each step follows logically from the premises using the rule of syllogism
By deductive reasoning, since ABCD is a square, it is also a rectangle, and therefore has four right angles.
• Syllogism: If A implies B and B implies C, then A implies C
• Universal Statement: "All X are Y" applies to every member of X
• Modus Ponens: If P implies Q and P is true, then Q is true
Inductive Reasoning: Observing patterns in specific cases to form general conclusions
1×3+1 = 3+1 = 4 = 2²
2×4+1 = 8+1 = 9 = 3²
3×5+1 = 15+1 = 16 = 4²
4×6+1 = 24+1 = 25 = 5²
For n×(n+2)+1, the result is (n+1)²
Left side: n×(n+2)+1
Right side: (n+1)²
For any positive integer n: n×(n+2)+1 = (n+1)²
For n=5: 5×7+1 = 35+1 = 36 = 6² ✓
For n=6: 6×8+1 = 48+1 = 49 = 7² ✓
n×(n+2)+1 = n²+2n+1 = (n+1)²
This confirms our pattern holds for all positive integers n
The pattern is: n×(n+2)+1 = (n+1)². For any positive integer n, multiplying n by (n+2) and adding 1 gives the square of (n+1).
• Pattern Recognition: Looking for consistent relationships in data
• Generalization: Extending observed patterns to all cases
• Verification: Testing the pattern with additional examples
Proof by Contradiction: Assuming the opposite of what you want to prove and showing it leads to a logical impossibility
Assume √2 is rational, meaning √2 = a/b where a and b are integers with no common factors (other than 1)
(√2)² = (a/b)²
2 = a²/b²
2b² = a²
Since 2b² = a², a² must be even (divisible by 2)
If a² is even, then a must be even (since odd² = odd)
So a = 2k for some integer k
2b² = a² = (2k)² = 4k²
b² = 2k²
This means b² is even, so b must also be even
We assumed a and b have no common factors, but now both a and b are even
This contradicts our original assumption
Since our assumption that √2 is rational leads to a contradiction, √2 must be irrational.
• Proof by Contradiction: If assuming ¬P leads to contradiction, then P must be true
• Rational Numbers: Defined as ratio of integers in lowest terms
• Parity Properties: Even² = even, odd² = odd
Counterexample: A specific example that shows a general statement is false
We need to find an integer n such that n² + n + 41 is not prime
n=0: 0² + 0 + 41 = 41 (prime)
n=1: 1² + 1 + 41 = 43 (prime)
n=2: 4 + 2 + 41 = 47 (prime)
n=3: 9 + 3 + 41 = 53 (prime)
Continuing this pattern seems to yield primes...
Notice that if n = 41, then n² + n + 41 = 41² + 41 + 41 = 41² + 2(41) = 41(41 + 2) = 41 × 43
When n = 41: n² + n + 41 = 41² + 41 + 41 = 1681 + 41 + 41 = 1763
1763 = 41 × 43, so it's not prime (it has factors 41 and 43)
When n = 41, we get: 41² + 41 + 41 = 41(41 + 1 + 1) = 41(43)
This is always composite when n equals the constant term
The statement is false. When n = 41, n² + n + 41 = 41 × 43 = 1763, which is not prime. Therefore, not all values of n² + n + 41 are prime.
• Counterexample Strategy: One example suffices to disprove a universal statement
• Algebraic Factoring: Recognizing when expressions can be factored
• Prime Testing: Checking if a number has divisors other than 1 and itself
Logical Implication: If P then Q (P → Q), where P is the hypothesis and Q is the conclusion
Original: If x > 5, then x² > 25 (P → Q)
P: x > 5
Q: x² > 25
If x > 5, then x² > 5² = 25 (since squaring preserves inequality for positive numbers)
So the original statement is TRUE
Converse: If x² > 25, then x > 5 (Q → P)
Counterexample: Let x = -6. Then x² = 36 > 25, but x = -6 < 5
So the converse is FALSE
Contrapositive: If x² ≤ 25, then x ≤ 5 (¬Q → ¬P)
If x² ≤ 25, then -5 ≤ x ≤ 5
Since x ≤ 5 is included in -5 ≤ x ≤ 5, the contrapositive is TRUE
The original statement and its contrapositive are logically equivalent and both TRUE
The converse is independent and happens to be FALSE
The original statement "If x > 5, then x² > 25" is true. Its contrapositive "If x² ≤ 25, then x ≤ 5" is also true. However, the converse "If x² > 25, then x > 5" is false, as shown by the counterexample x = -6.
• Logical Equivalence: P → Q ≡ ¬Q → ¬P (original and contrapositive)
• Converse Independence: P → Q does not imply Q → P
• Counterexample: One example suffices to disprove a statement