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 quiz has three judges. Let p, q and r say that judge 1, judge 2 and judge 3 votes yes…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningNumericalConceptual

A quiz has three judges. Let p, q and r say that judge 1, judge 2 and judge 3 votes yes…

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 quiz has three judges. Let ppp, qqq and rrr say that judge 1, judge 2 and judge 3 votes yes. The rule book says a player gets a bonus when "exactly one judge votes yes". A scorer writes the rule as (p⊕q)⊕r(p \oplus q) \oplus r(p⊕q)⊕r, where ⊕\oplus⊕ is the exclusive or. Count the rows of the truth table in which the rule book's condition holds, and the rows in which the scorer's statement is true. In how many rows do they differ? Describe that row.

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. Three statements ppp, qqq, rrr, and two conditions: exactly one true, and (p⊕q)⊕r(p \oplus q) \oplus r(p⊕q)⊕r.

Plan. Count each condition, then find where they disagree.

Step 1. Exactly one yes. Choose which judge says yes: 333 rows (T, F, F), (F, T, F) and (F, F, T).

Step 2. The scorer's statement. Each ⊕\oplus⊕ flips the value when its new part is true. So (p⊕q)⊕r(p \oplus q) \oplus r(p⊕q)⊕r is true when an odd number of ppp, qqq, rrr are true: one of them or all three. That is 3+1=43 + 1 = 43+1=4 rows.

Step 3. The difference. The rows agree everywhere except (T, T, T). There the chain gives (F)⊕T=T(\mathrm{F}) \oplus \mathrm{T} = \mathrm{T}(F)⊕T=T, while "exactly one" is false. So they differ in 111 row.

Check. Row (T, T, F): p⊕qp \oplus qp⊕q is F, and F⊕F\mathrm{F} \oplus \mathrm{F}F⊕F is F. Both conditions are false, as they should be.

Watch out. For two statements, the exclusive or means exactly one. For three or more, a chain of exclusive ors means an odd number.

Answer: 333 rows, 444 rows, and they differ in 111 row, when all three judges vote yes.

Log in to save this for later
← All Problems
← A lift in an office block moves only when its doors are shut…Simplify the statement S: ∼(∼ p wedge q) wedge (p vee q) step by step, naming the law you use at… →
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 →