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. /Decide the truth value of each statement…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumerical

Decide the truth value of each statement…

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.

Decide the truth value of each statement. Then count the true ones.

  1. If 2+2=52 + 2 = 52+2=5, then the Moon is a star.
  2. If 777 is odd, then 777 is prime.
  3. If 999 is odd, then 999 is prime.
  4. 444 is even if and only if 555 is odd.
  5. 666 is prime if and only if 666 is even.

For each false statement, say which part makes it false. Statement 1 sounds silly. Explain carefully why logic still gives it a truth value.

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 \Rightarrow qp⇒q is false only when ppp is true and qqq is false, and p⇒q≡∼p∨qp \Rightarrow q \equiv \sim p \vee qp⇒q≡∼p∨q. 'ppp only if qqq' means p⇒qp \Rightarrow qp⇒q. ∼(p⇒q)≡p∧∼q\sim(p \Rightarrow q) \equiv p \wedge \sim q∼(p⇒q)≡p∧∼q. p⇔qp \Leftrightarrow qp⇔q is true when ppp and qqq agree.

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.

Plan. Find the truth value of each part, then apply the table.

Step 1. Statement 1. The hypothesis 2+2=52 + 2 = 52+2=5 is false. A conditional with a false hypothesis is true, whatever the conclusion. So it is T.

Step 2. Statement 2. 777 is odd (T) and 777 is prime (T). T ⇒\Rightarrow⇒ T is T.

Step 3. Statement 3. 999 is odd (T) but 9=3×39 = 3 \times 39=3×3 is not prime (F). T ⇒\Rightarrow⇒ F is F. The conclusion makes it false.

Step 4. Statement 4. Both parts are true, so the biconditional is T.

Step 5. Statement 5. "666 is prime" is F and "666 is even" is T. The parts differ, so it is F.

Count. Statements 1, 2 and 4 are true: 333 in all.

Why statement 1 has a value. A conditional only promises qqq in the cases where ppp holds. When ppp never holds, the promise is never broken, so the statement is true.

Answer: 333 true statements.

Log in to save this for later
← All Problems
← Prove, using the laws of the algebra of statements and not a truth table, that ∼big(p vee (∼ p…A college prints three rules about a certificate… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Conditional and biconditional statementsConditionals, Contrapositives and Quantifiers

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 →