Foundation to VCE • Explore the maths library • Try a free sample
Year 9 · Space

Teach geometric construction algorithms.

Design and test geometric algorithms using explicit conditions.

View worksheets & preview

Aspire to Power Learning · https://resources.aspiretopowerlearning.com.au/home-learning/topics/year-9-geometric-construction-algorithms/

Check the starting point

  • Compare sums of side lengths
  • Follow ordered geometric instructions

Show the idea

Test a triangle algorithm at its boundary

SidesSmallest two sumLargestValid?
4, 5, 898Yes
4, 5, 999No: equality
4, 5, 10910No: too short

A valid non-degenerate triangle needs positive lengths and a + b > c after sorting a ≤ b ≤ c.

Work through an example

Test a triangle algorithm at its boundary — explain the representation.

SidesSmallest two sumLargestValid?
4, 5, 898Yes
4, 5, 999No: equality
4, 5, 10910No: too short
  1. A valid non-degenerate triangle needs positive lengths and a + b > c after sorting a ≤ b ≤ c.
  2. Connect the labels to the calculation or rule. Triangle inequality is strict; equality is not a triangle.

Answer: A valid non-degenerate triangle needs positive lengths and a + b > c after sorting a ≤ b ≤ c.

Teach in small steps

  1. Begin with a short oral check: ask your child to compare sums of side lengths. Then check that they can follow ordered geometric instructions. Revisit either skill before adding a new procedure.
  2. Explore “Test a triangle algorithm at its boundary” together. A valid non-degenerate triangle needs positive lengths and a + b > c after sorting a ≤ b ≤ c. Ask your child to point to the quantities or features used at each step.
  3. Model the example: Test whether 4,6,10 form a triangle. Pause before each step and invite a prediction. Order the lengths. 4+6=10, not greater than 10.
  4. Work together on the first new practice question: Use the triangle inequality to test lengths 6, 11 and 16. Have your child attempt the remaining learn questions with less help, then move to apply. Use the checkpoint on a later attempt to see which ideas are retained.

Ask and listen

  • For fixed sides 4 and 9, give the strict range of possible third side x.
  • A program tests only sides 3, 4, 5 before being declared correct. Give one ordinary invalid case and one boundary invalid case.

Adapt the practice

More support

Return to “Test a triangle algorithm at its boundary” and explain one label or step at a time. Triangle inequality is strict; equality is not a triangle. Let your child show a calculation, drawing or spoken explanation before requiring a polished written answer.

More challenge

Try this application after the core method is secure: An algorithm accepts 0, 5 and 5 because 0 + 5 ≥ 5. Identify both missing safeguards. Then ask which assumption or input could be changed and what would need to be recalculated.

Look for understanding

  • The learner can complete and explain this checkpoint task: Describe a check for a constructed perpendicular bisector of segment AB.
  • The learner can address the reasoning or error-checking question: A program tests only sides 3, 4, 5 before being declared correct. Give one ordinary invalid case and one boundary invalid case. Accept a correct alternative method, but ask for the mathematical reason.

Choose the next step

If both checks can be explained without prompting, continue to Survey methods and bias. If a method is still uncertain, repeat the visual example with fresh numbers before progressing.

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