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 , and 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 , where 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.
is true only when both parts are true, and is false only when both are false. The exclusive or is true when exactly one part is true. With simple statements a truth table has rows.
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 , , , and two conditions: exactly one true, and .
Plan. Count each condition, then find where they disagree.
Step 1. Exactly one yes. Choose which judge says yes: rows (T, F, F), (F, T, F) and (F, F, T).
Step 2. The scorer's statement. Each flips the value when its new part is true. So is true when an odd number of , , are true: one of them or all three. That is rows.
Step 3. The difference. The rows agree everywhere except (T, T, T). There the chain gives , while "exactly one" is false. So they differ in row.
Check. Row (T, T, F): is F, and 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: rows, rows, and they differ in row, when all three judges vote yes.
Log in to join the discussion.
Loading…