Check the starting point
- Use the truth values true and false consistently.
- Trace variable assignments in their actual order.
Show the idea
Truth table for an implication
| p | q | p implies q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
Only a true premise with a false conclusion falsifies the implication. This is different from asserting its converse.
Work through an example
Simplify (p AND q) OR (p AND NOT q).
- Apply the distributive law to the common proposition p: (p AND q) OR (p AND NOT q) = p AND (q OR NOT q).
- Exactly one of q and NOT q is true, so q OR NOT q is always true.
- The remaining expression is p AND true, which has the same truth value as p.
Answer: p.
Teach in small steps
- Read the visual model together: Only a true premise with a false conclusion falsifies the implication. This is different from asserting its converse.
- Model this example aloud: Convert binary 11010 to decimal and decimal 22 to binary. Guide: 11010 gives 16+8+2=26. For 22, use 16+4+2. Result: 26 and 10110.
- Let your learner choose the steps for a new situation: Trace x=2; repeat three times: x=3x−1. Give every updated value. Ask which part of the model or rule carries over before checking the worked solution.
- After a short break, ask for an independent response: Simplify (p OR q) AND (p OR NOT q). Compare both the method and conclusion with the checkpoint answers, then revisit any misconception.
Ask and listen
- Use De Morgan’s law to negate p OR q.
- Trace Euclid’s algorithm for gcd(56,35), giving successive remainders.
Adapt the practice
More support
Start with this prerequisite: Use the truth values true and false consistently. Keep the visual visible. For the first guided problem, focus on this step: 11010 gives 16+8+2=26. For 22, use 16+4+2.
More challenge
Try this application without looking at its answer: Is the argument p⇒q, NOT q, therefore NOT p valid? Explain. Then explain why the answer fits the stated domain or context.
Look for understanding
- Your learner can complete this checkpoint and explain the method: Simplify (p OR q) AND (p OR NOT q).
- Your learner can justify or challenge this statement/question using the mathematical definitions: Trace Euclid’s algorithm for gcd(56,35), giving successive remainders.
Choose the next step
If either checkpoint needs prompting, repeat the worked model with changed values and revisit this caution: The implication p⇒q is false only when p is true and q is false. When both are secure, use the linked Apply and extend resource and relevant VCE Key Knowledge/Key Skills activity.
Put the idea into practice
The matching topic collection includes learn-and-practise, application and checkpoint PDFs with worked answers. Download the free preview to see representative pages.
Explore this topic’s worksheets