Logo
Published on

Contrapositive of Multiples of 6

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

Consider the statement: ``For all integers nn, if nn is a multiple of 6, then nn is a multiple of 2.''

Which of the following is the contrapositive of this statement?

  • There exists an integer nn such that nn is a multiple of 6 and not a multiple of 2.
  • There exists an integer nn such that nn is a multiple of 2 and not a multiple of 6.
  • For all integers nn, if nn is not a multiple of 2, then nn is not a multiple of 6.
  • For all integers nn, if nn is not a multiple of 6, then nn is not a multiple of 2.

Hints

Attempt the proof independently first. Focus on the key theorem, algebraic transformation, or contradiction setup that links the hypothesis to the target conclusion.


Solutions

Logical Analysis of Contrapositive

Step 1: Identify the logical structure

The original statement has the form:

nZ,P(n)    Q(n)\forall n \in \mathbb{Z}, \quad P(n) \implies Q(n)

Where:

  • P(n)P(n): ``nn is a multiple of 6''
  • Q(n)Q(n): ``nn is a multiple of 2''

Step 2: Apply contrapositive definition

The contrapositive of P    QP \implies Q is ¬Q    ¬P\neg Q \implies \neg P.

Key: The universal quantifier (``for all'') remains unchanged.

Step 3: Negate each part

  • ¬Q(n)\neg Q(n): ``nn is NOT a multiple of 2''
  • ¬P(n)\neg P(n): ``nn is NOT a multiple of 6''

Step 4: Construct the contrapositive

nZ,¬Q(n)    ¬P(n)\forall n \in \mathbb{Z}, \quad \neg Q(n) \implies \neg P(n)

In words: ``For all integers nn, if nn is not a multiple of 2, then nn is not a multiple of 6.''

This matches Option C.

Analysis of incorrect options:

  • Option A: Negation of original (n:P(n)¬Q(n)\exists n: P(n) \land \neg Q(n)), not contrapositive
  • Option B: Negation of converse
  • Option D: Inverse (¬P    ¬Q\neg P \implies \neg Q), not contrapositive

Answer: C}


Takeaways

  • Contrapositive Form: P    QP \implies Q has contrapositive ¬Q    ¬P\neg Q \implies \neg P (swap and negate both parts)
  • Logical Equivalence: A statement and its contrapositive are logically equivalent (same truth value)
  • Quantifiers Unchanged: Universal quantifier (``for all'') stays when forming contrapositive
  • Common Errors: Inverse (¬P    ¬Q\neg P \implies \neg Q) and converse (Q    PQ \implies P) are NOT equivalent to original

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:


Connect with me

If you're eager for more HSC Maths insights, be sure to check out my Instagram. For deeper dives and regular tips, join my Website - Vu's Maths Hub. Let's tackle these challenging math problems together! You can also catch my daily math content on LinkedIn.