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. Problems
  2. /Write each argument in symbols and decide whether it is valid…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumericalConceptual

Write each argument in symbols and decide whether it is valid…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Write each argument in symbols and decide whether it is valid. Name the form or the fallacy.

  1. If it rains, the ground is wet. The ground is wet. So it rained.
  2. If it rains, the ground is wet. The ground is not wet. So it did not rain.
  3. The key is in the bag or in the drawer. It is not in the bag. So it is in the drawer.
  4. If a number is divisible by 666, it is divisible by 333. The number 151515 is not divisible by 666. So 151515 is not divisible by 333.

How many of the four arguments are valid? For each invalid one, give the row of truth values that shows it.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

An argument is valid when its conclusion is true in every row where all premises are true. Valid forms: modus ponens, modus tollens, the chain rule, disjunctive syllogism. Fallacies: affirming the consequent and denying the antecedent.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Step 1. Argument 1. p⇒qp \Rightarrow qp⇒q, qqq; so ppp. This affirms the consequent. Bad row: ppp F, qqq T (the ground is wet from a hose). Not valid.

Step 2. Argument 2. p⇒qp \Rightarrow qp⇒q, ∼q\sim q∼q; so ∼p\sim p∼p. Modus tollens. Valid.

Step 3. Argument 3. p∨qp \vee qp∨q, ∼p\sim p∼p; so qqq. Disjunctive syllogism. Valid.

Step 4. Argument 4. p⇒qp \Rightarrow qp⇒q, ∼p\sim p∼p; so ∼q\sim q∼q. This denies the antecedent. The bad row is ppp F, qqq T, and 151515 is exactly such a case: not divisible by 666, but divisible by 333. Not valid, and its conclusion is even false.

Count. Arguments 2 and 3 are valid: 222 of them.

Answer: 222 valid arguments.

Log in to save this for later
← All Problems
← Consider the claim "for every real number x, x² > x"…Use truth tables to test two arguments in p, q and r… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Validating statements and argumentsValid Arguments and Methods of Proof

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
  4. Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…
Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →