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. /A college prints three rules about a certificate…
HardMathematicsHigh School (11–12)Mathematical ReasoningNumericalConceptual

A college prints three rules about a certificate…

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.

A college prints three rules about a certificate. Let aaa be "the student attends every class" and ccc be "the student gets the certificate".

  • Rule 1: a student gets the certificate only if she attends every class.
  • Rule 2: attending every class is sufficient for the certificate.
  • Rule 3: a student gets the certificate if and only if she attends every class.

Write each rule in symbols. There are four situations, one for each pair of truth values of aaa and ccc. How many situations break at least one of Rules 1 and 2? How many situations break Rule 3? Explain why Rule 3 says exactly as much as Rules 1 and 2 together.

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.

Step 1. In symbols. Rule 1 is c⇒ac \Rightarrow ac⇒a. Rule 2 is a⇒ca \Rightarrow ca⇒c. Rule 3 is c⇔ac \Leftrightarrow ac⇔a.

Step 2. Rule 1 fails only when ccc is T and aaa is F: a certificate without full attendance.

Step 3. Rule 2 fails only when aaa is T and ccc is F: full attendance and no certificate.

Step 4. Rules 1 or 2. These are two different situations, so 222 situations break at least one of them.

Step 5. Rule 3 fails when aaa and ccc differ: the same 222 situations.

Why they match. c⇔a≡(c⇒a)∧(a⇒c)c \Leftrightarrow a \equiv (c \Rightarrow a) \wedge (a \Rightarrow c)c⇔a≡(c⇒a)∧(a⇒c). Rule 3 is true exactly when both Rules 1 and 2 are true.

Watch out. "Only if" gives the condition that is needed. It does not promise the certificate. That promise is Rule 2.

Answer: 222 situations break Rule 1 or Rule 2, and the same 222 break Rule 3.

Log in to save this for later
← All Problems
← Decide the truth value of each statement…Prove, with the laws of logic, that p ⇒ (q ⇒ r) ≡ (p wedge q) ⇒ r… →
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 →