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. /Simplify the statement S: ∼(∼ p wedge q) wedge (p vee q) step by step, naming the law you use at…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

Simplify the statement S: ∼(∼ p wedge q) wedge (p vee q) step by step, naming the law you use at…

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.

Simplify the statement SSS: ∼(∼p∧q)∧(p∨q)\sim(\sim p \wedge q) \wedge (p \vee q)∼(∼p∧q)∧(p∨q) step by step, naming the law you use at each step. Then use your simple form to answer two questions. In how many of the four rows of the truth table is SSS true? A student claims that SSS is a tautology because it "contains both ppp and ∼p\sim p∼p". Is the student right? Give the value of SSS in the row where ppp is false and qqq is true, as 111 for true or 000 for false.

Check your answer

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

Need a reminder? The key ideaShowHide

A tautology is always true and a contradiction always false. De Morgan: ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q. Distributive, complement, identity and absorption laws simplify a statement. Series is ∧\wedge∧, parallel is ∨\vee∨.

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.

Given. S=∼(∼p∧q)∧(p∨q)S = \sim(\sim p \wedge q) \wedge (p \vee q)S=∼(∼p∧q)∧(p∨q).

Plan. Use De Morgan, then the distributive law, then the complement and identity laws.

Step 1. De Morgan and double negation. ∼(∼p∧q)≡p∨∼q\sim(\sim p \wedge q) \equiv p \vee \sim q∼(∼p∧q)≡p∨∼q.

Step 2. Distributive law, read backwards. (p∨∼q)∧(p∨q)≡p∨(∼q∧q)(p \vee \sim q) \wedge (p \vee q) \equiv p \vee (\sim q \wedge q)(p∨∼q)∧(p∨q)≡p∨(∼q∧q).

Step 3. Complement. ∼q∧q≡F\sim q \wedge q \equiv \mathrm{F}∼q∧q≡F.

Step 4. Identity. p∨F≡pp \vee \mathrm{F} \equiv pp∨F≡p. So S≡pS \equiv pS≡p.

Step 5. The questions. SSS is true exactly when ppp is true: 222 of the 444 rows. It is not a tautology. In the row with ppp F and qqq T, SSS is F, written 000.

Check. Directly, with ppp F and qqq T: ∼p∧q\sim p \wedge q∼p∧q is T, so the first bracket is F, and SSS is F.

Answer: S≡pS \equiv pS≡p; it is true in 222 rows, and its value in that row is 000.

Log in to save this for later
← All Problems
← A quiz has three judges. Let p, q and r say that judge 1, judge 2 and judge 3 votes yes…Classify each statement as a tautology, a contradiction or a contingency… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Tautologies, equivalence and switching circuitsStatements, Connectives and Truth Tables

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
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 →