How to Perform in PSLE | Learner’s Guide Vol 0862 | Mathematics: An n-Sided Polygon Has n Times n Minus Three Divided by Two Diagonals

CHAPTER 1 OF 12 · Back to contents

1. Define a diagonal precisely

A polygon diagonal joins two non-adjacent vertices. A side joins adjacent vertices, so not every segment between vertices is a diagonal.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

• Check the n vertices of the polygon.
• Check the n minus three non-adjacent choices.
• Check the double count from two endpoints.
• Check the distinction between sides and diagonals.

Contents · Next

CHAPTER 2 OF 12 · Back to contents

2. Count choices from one vertex

From one vertex of an n-sided polygon, exclude the vertex itself and its two adjacent vertices. That leaves n−3 vertices that can be joined by diagonals.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 3 OF 12 · Back to contents

3. Multiply across all vertices

There are n starting vertices and n−3 diagonal choices from each, giving n(n−3) directed endpoint selections.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 4 OF 12 · Back to contents

4. Correct the double count

Every actual diagonal is counted once from each endpoint. Divide by 2 to count each segment once, producing n(n−3)/2.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 5 OF 12 · Back to contents

5. Check small polygons

A triangle gives 3(0)/2=0 diagonals; a quadrilateral gives 4(1)/2=2; a pentagon gives 5(2)/2=5. These match direct drawings.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 6 OF 12 · Back to contents

6. Separate diagonals from all vertex pairs

All pairs of vertices number n(n−1)/2. Subtract the n sides to get n(n−1)/2−n=n(n−3)/2, an equivalent derivation.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 7 OF 12 · Back to contents

7. Use drawings as checks, not substitutes

A labelled sketch helps prevent missed or repeated lines for small n. For a large polygon, the formula is safer than an untidy drawing.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 8 OF 12 · Back to contents

8. Control examination working

State n, identify n−3 choices per vertex, multiply, divide by 2 for double counting and verify with a known polygon. Do not accept a side or a repeated segment.

Build the explanation by naming the n vertices of the polygon and the n minus three non-adjacent choices. A remembered keyword is not enough: connect the observation to the mechanism and identify what would have to change for the conclusion to change.

Repair the nearest misconception by checking the double count from two endpoints and returning to the distinction between sides and diagonals. State why the tempting alternative is too strong, incomplete or about a different stage.

Contents · Previous · Next

CHAPTER 9 OF 12 · Back to contents

9. Worked examples

Worked case 1: How many diagonals does a triangle have?

Controlled answer. 0. Every pair of vertices is adjacent, so 3(3−3)/2=0.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Draw and check. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “0” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 2: How many diagonals does a quadrilateral have?

Controlled answer. 2. Use 4(1)/2=2.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Name the opposite vertex pairs. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “2” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 3: How many diagonals does a pentagon have?

Controlled answer. 5. Use 5(2)/2=5.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Draw a five-point check. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “5” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 4: How many diagonals does a hexagon have?

Controlled answer. 9. Use 6(3)/2=9.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Count from one vertex first. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “9” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 5: How many diagonals come from one vertex of an octagon?

Controlled answer. 5. Exclude the vertex itself and its two neighbours: 8−3.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. List the excluded points. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “5” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 6: Why subtract 3 from n?

Controlled answer. One choice is the same vertex and two choices are adjacent vertices joined by sides. Only non-adjacent vertices form diagonals.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Apply to a heptagon. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “One choice is the same vertex and two choices are adjacent vertices joined by sides” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 7: Why divide by 2?

Controlled answer. Each diagonal is counted from both of its endpoints. The multiplication treats the two directions separately.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Label one repeated diagonal. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “Each diagonal is counted from both of its endpoints” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 8: Repair: an n-gon has n(n−3) diagonals.

Controlled answer. Divide by 2. The expression double-counts each diagonal.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Explain the two counts. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “Divide by 2” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 9: Repair: a pentagon has 10 diagonals because there are 10 vertex pairs.

Controlled answer. A pentagon has 5 diagonals. Five of the ten vertex pairs are sides.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Subtract sides. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “A pentagon has 5 diagonals” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 10: How many vertex pairs does a hexagon have?

Controlled answer. 15. Use 6×5÷2.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Subtract six sides. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “15” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 11: Use all pairs minus sides for an octagon.

Controlled answer. 20 diagonals. There are 8×7÷2=28 pairs and 8 sides, leaving 20.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Compare with the main formula. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “20 diagonals” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Worked case 12: Can a side also be a diagonal?

Controlled answer. No under the standard polygon definition. Diagonals join non-adjacent vertices.

Mechanism. Identify the exact relationship, apply the relevant rule and preserve every stated condition. A surface clue may be compatible with several explanations, so the answer must show what makes this case decisive.

Misconception repair. Do not turn partial evidence into complete proof. Name the closest wrong answer, identify its missing condition and explain why the observed evidence supports the narrower conclusion.

Transfer. Classify three segments. Solve the altered case from the mechanism rather than copying the previous wording.

Reverse construction. Begin with the controlled answer “No under the standard polygon definition” and invent a fresh prompt that would justify it for the same reason. Then change one decisive condition to create a near-nonexample. This reverse task checks whether the learner owns the boundary rather than merely recognising the original sentence.

Explanation standard. A complete explanation names the observation, connects it to the rule and limits the conclusion to what follows. It should remain valid if decorative details are removed. If the explanation depends on the story topic instead of the decisive relation, rebuild it.

Audit. Recheck the n vertices of the polygon, the n minus three non-adjacent choices, the double count from two endpoints, the distinction between sides and diagonals. Decide whether the evidence proves the conclusion or only supports a limited statement.

Contents · Previous · Next

CHAPTER 10 OF 12 · Back to contents

10. Independent practice

Practice 1: Does a concave polygon still use the same count if it is a simple n-gon?

Explained answer. Yes. Adjacency of vertices still determines sides and diagonals, even if some diagonals lie partly outside.

Delayed transfer. Keep the definition structural. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 2: What value of n gives 14 diagonals?

Explained answer. 7. Solve n(n−3)/2=14; 7×4/2=14.

Delayed transfer. Verify with a heptagon. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 3: What value of n gives 20 diagonals?

Explained answer. 8. Eight times five divided by two is twenty.

Delayed transfer. State the polygon name. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 4: Why is the formula always a whole number?

Explained answer. The double-counted total n(n−3) is even. If n is even it supplies the factor 2; if n is odd, n−3 is even.

Delayed transfer. Check both parity cases. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 5: What is the nearest wrong shortcut?

Explained answer. Counting every vertex pair as a diagonal. Adjacent pairs are sides and must be excluded.

Delayed transfer. Use all-pairs minus sides. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 6: How should a large drawing be audited?

Explained answer. Label vertices and record endpoint pairs in a systematic order. This reduces omission and duplication.

Delayed transfer. Compare with the formula total. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 7: Which derivation is useful as a check?

Explained answer. All vertex pairs minus the n sides. It gives the same algebraic result by a different route.

Delayed transfer. Simplify the expression. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Practice 8: State the full method.

Explained answer. For an n-gon, count n−3 possible diagonals from each of n vertices, divide by 2 because each diagonal has two endpoints, and verify that sides were excluded. Use n(n−1)/2−n as an independent check.

Delayed transfer. Solve a forward and reverse case. Cover the answer later and rebuild the chain.

Control question. Which exact condition does the nearest wrong answer miss? State it before checking.

Extension. Change one decisive feature while keeping the story similar. Explain why the conclusion now stays or changes.

Independent proof. Restate the answer without copying its wording. Your version must identify the evidence, the governing relationship and the boundary of the claim. Then write one fact that would be relevant but still insufficient on its own. This separates explanation from repetition.

Delayed comparison. Save this item beside the near-nonexample you created. On the next attempt, compare them before answering and point to the single feature that controls the difference. If more than one feature changed, revise the pair so the comparison stays fair.

Contents · Previous · Next

CHAPTER 11 OF 12 · Back to contents

11. Delayed transfer

On day one, solve clear examples. On day three, mix examples, near-nonexamples and incomplete evidence. On day seven, solve without headings or a word bank. Delay reveals whether the method can be reconstructed independently.

Keep an error log for the first failed stage: reading, representation, rule, execution or checking. The earliest failure identifies the repair.

Interleave this skill with neighbouring ideas that share vocabulary. Classify each item only after naming the distinguishing condition.

In timed work, mark the relationship, apply the rule, write the conclusion and audit one condition. If checking changes the answer, record the overlooked feature.

Create a teach-back card with a near-nonexample on the front and the repaired mechanism on the back. Explain why the tempting answer fails.

Finish with one basic example, one boundary case and one transfer case. Supply explanations that a classmate can verify.

For a second delayed test, reverse the direction: start from a conclusion and invent evidence that would justify it, then evidence that would be insufficient. This exposes the boundary between relevance and proof.

Contents · Previous · Next

CHAPTER 12 OF 12 · Back to contents

12. Family guidance and FAQs

Guidance for parents and tutors

Ask for the decisive condition before confirming the answer. Use prompts such as “What exactly happened?”, “Which stage or meaning is this?” and “What would prove it?”

Fade support from labelled examples to mixed questions and delayed open response. Independent retrieval after time and topic change is the target.

Praise precise claim control. Narrowing an answer when evidence is incomplete is scientific and academic strength.

Frequently asked questions

Should I memorise the rule?

Memorise the compact rule, then practise examples and near-nonexamples so the conditions remain visible.

What if two answers seem possible?

Return to the exact relationship and choose the option satisfying every stated condition without adding facts.

Why delay practice?

Immediate repetition may depend on the recent explanation; delay tests reconstruction.

How should an error be corrected?

Name the first failed stage and practise it with a changed example.

When is the skill ready?

When the learner can explain, apply and transfer it after a delay.

What is the final audit?

Check relationship, mechanism, claim strength and whole-question fit.

Next routes

Continue at the Mathematics learning hub or return to the series directory.

Contents · Previous