HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Notes
  2. /Valid Arguments and Methods of Proof: Quick Revision
Mathematics

Valid Arguments and Methods of Proof: Quick Revision

A brief note on validating statements, valid arguments and fallacies, direct proof, the contrapositive, exhaustion, counterexamples, proof by contradiction and proof by cases, with practice and questions.

StemPy LabWritten by StemPy Lab
Log in to save

A brief note on Valid Arguments and Methods of Proof. Read it before a test. Try each question at the end before you open its answer.

Validating a statement

  • And: show both parts.
  • Or: assume one part false, show the other.
  • If-then: direct, contrapositive or contradiction.
  • If and only if: show both directions.

Arguments

  • Valid: (premises) ⇒\Rightarrow⇒ (conclusion) is a tautology.
  • Valid forms: modus ponens, modus tollens, the chain rule, disjunctive syllogism.
  • Fallacies: affirming the consequent, denying the antecedent.
  • A valid argument with a false premise can have a false conclusion.

Methods of proof

  • Direct: assume ppp, reach qqq.
  • Contrapositive: assume ∼q\sim q∼q, reach ∼p\sim p∼p.
  • Exhaustion: check every one of finitely many cases.
  • Counterexample: one case disproves a for-all claim.
  • Contradiction: assume the claim is false, reach the impossible.
  • Cases: cover every possibility, prove each.
A flow chart of four methods of proof for a statement 'if p then q'. Direct: start from p, a chain of steps, end at q. Contrapositive: start from not q, a chain of steps, end at not p. Contradiction: start from p and not q together, a chain of steps, end at an impossible statement, then conclude that the statement is true. Counterexample: one case with p true and q false shows that a for-all claim is false.

A worked example

Prove that n2−nn^2 - nn2−n is even for every integer nnn.

  1. Factorise. n2−n=n(n−1)n^2 - n = n(n - 1)n2−n=n(n−1).
  2. Cases. If nnn is even, the factor nnn is even. If nnn is odd, n−1n - 1n−1 is even.
  3. Conclusion. In both cases the product is even.

Practice with new numbers

A program to try

The program checks an argument row by row, and tests a claim on many numbers to look for a counterexample.

Read it first. Then run it. Is the argument valid, and does the claim have a counterexample?

1. Change the claim to n * n + n + 17. What is the first counterexample now?

Mistakes to avoid

  • Proving a for-all claim by examples.
  • Affirming the consequent.
  • Proving the converse instead of the contrapositive.
  • Cases that miss a possibility.

Check yourself

  1. From p⇒qp \Rightarrow qp⇒q and ppp, what follows?
  1. Give a counterexample to 'every prime is odd'.
  1. What does a proof by contradiction of 'if ppp then qqq' assume?
  1. Can a perfect square end in 777?
  1. Among 101010 whole numbers, must two leave the same remainder on division by 999?

Sources

  • NCERT, Mathematics Textbook for Class XI (edition before 2023), Chapter 14, and Class XII, Part II, Appendix 1.
  • Richard Hammack, Book of Proof, third edition, Chapters 4 to 6.
← All Notes
← Conditionals, Contrapositives and Quantifiers: Quick RevisionNext →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

On this page

  1. Validating a statement
  2. Arguments
  3. Methods of proof
  4. A worked example
  5. Practice with new numbers
  6. A program to try
  7. Mistakes to avoid
  8. Check yourself
  9. Sources

Goes with the lesson

  1. Proof by contradiction and by casesValid Arguments and Methods of Proof

More notes on this topic

  1. Conditionals, Contrapositives and Quantifiers: Quick Revision
  2. Statements, Connectives and Truth Tables: Quick Revision
All notes on this topic →