Skip to content
Worked Examples · Example 16

Q.By giving a counter example, show that the following statement is false.
If n is an odd integer, then n is prime.

Mahe DhseTextbookSubjectiveImportance★★★★★est
36% · 16/45 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Claim to disprove: "If n is an odd integer, then n is prime."

To disprove a universal "if-then" claim, it suffices to find just one counter-example — a value satisfying the hypothesis but not the conclusion.

Consider n=9n = 9. It is odd (9 = 2(4) + 1). However, 9=3×39 = 3 \times 3, so 9 has a divisor (3) other than 1 and itself — it is not prime. …

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.