Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Let , the faces of a die. Decide the truth value of each statement, with and in :
How many of the four are true? Write the negation of C, and count the pairs of that make the negation true.
and . One counterexample disproves a for-all statement. The order of two different quantifiers matters.
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. A. For each in , is also in . True.
Step 2. B. Take . Then for every . True.
Step 3. C. and give . False.
Step 4. D. Take . Then for every . True.
Step 5. Count. A, B and D are true: statements.
Step 6. The negation of C. . The only pair is , so pair.
Check. In B the order matters: one must work for all . In A each gets its own .
Answer: statements are true, and pair makes the negation of C true.
Log in to join the discussion.
Loading…