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. /Let p be "17 is a prime number", let q be "every even number is divisible by 4" and let r be "the…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

Let p be "17 is a prime number", let q be "every even number is divisible by 4" and let r be "the…

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.

Let ppp be "171717 is a prime number", let qqq be "every even number is divisible by 444" and let rrr be "the angles of a triangle add up to 180∘180^\circ180∘". First give the truth value of each simple statement. Then find the truth values of

  • AAA: (p∧∼q)∨r(p \wedge \sim q) \vee r(p∧∼q)∨r,
  • BBB: ∼(p∨q)∧r\sim(p \vee q) \wedge r∼(p∨q)∧r,
  • CCC: (p∧q)∨(∼p∧r)(p \wedge q) \vee (\sim p \wedge r)(p∧q)∨(∼p∧r).

Write 111 for true and 000 for false in each answer box.

Check your answer

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

Need a reminder? The key ideaShowHide

p∧qp \wedge qp∧q is true only when both parts are true, and p∨qp \vee qp∨q is false only when both are false. The exclusive or is true when exactly one part is true. With nnn simple statements a truth table has 2n2^n2n rows.

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. ppp is T (171717 has no factor other than 111 and itself). qqq is F, because 666 is even and 666 is not divisible by 444. rrr is T.

Plan. Put the values in and work from the inside out.

Step 1. Statement A. ∼q\sim q∼q is T, so p∧∼qp \wedge \sim qp∧∼q is T. An "or" with a true part is true. So AAA is T, written 111.

Step 2. Statement B. p∨qp \vee qp∨q is T, so ∼(p∨q)\sim(p \vee q)∼(p∨q) is F. An "and" with a false part is false. So BBB is F, written 000.

Step 3. Statement C. p∧qp \wedge qp∧q is F, since qqq is F. ∼p\sim p∼p is F, so ∼p∧r\sim p \wedge r∼p∧r is F. Both parts of the "or" are false, so CCC is F, written 000.

Check. In BBB, the value of rrr does not matter once ∼(p∨q)\sim(p \vee q)∼(p∨q) is false. That is a quick way to see the answer.

Answer: A=1A = 1A=1, B=0B = 0B=0, C=0C = 0C=0.

Log in to save this for later
← All Problems
← A thermostat sends a signal while the room temperature t, in degrees Celsius, satisfies "t is…A lift in an office block moves only when its doors are shut… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Connectives and truth tablesStatements, 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
  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 →