![]() |
The netball tournament
Number, Level 2 Problem ![]() There are six A Grade netball teams in the local inter-school netball tournament. During the tournament, they all need to play each other once. How many matches will be played once they have done this? What is this problem about? This problem requires students to make lists, be systematic, maintain a running addition total, eliminate possibilities and explain their results. (Some students may also identify the sequential pattern and devise a rule.) The rule that comes from this problem (see Solution) is an example of a combination problem. Combination problems are one of several classes of counting problems that become more and more important in statistics as well as in certain branches of mathematics. At senior high school level, combinations are often needed in probability questions. Achievement Objectives Number, Level 2 - make sensible estimates and check the reasonableness of answers Mathematical Processes - effectively plan mathematical exploration - devise and use problem-solving strategies to explore situations mathematically - record, in an organised way, and talk about the results of mathematical exploration Resources required - Paper for making lists and matching teams or drawing - 6 students could represent the 6 teams and through systematic matching, eliminate all the possible combinations - Copymaster of the problem (English) Specific learning outcomes The children will be able to: - solve a problem by being systematic - compare an estimate with the result Teaching Sequence
Extension If another team joined the tournament, how many matches would be played? What is the pattern for the number of games and can you devise a rule? Other Contexts for the Problem Any sports team tournament. Hand shaking at a party Solution With 6 teams, 15 games would be played in total. Students could make lists, act it out, draw or systematically match teams in columns. For clarity of working it may help students to progressively list all the combinations starting with team 1 e.g., 1 plays 2 2 - 3 3 - 4 1 plays 3 2 - 4 1 plays 4 2 - 5 1 plays 5 2 - 6 1 plays 6 5 games 4 games etc Another way to look at this is to see that the each team has to play five others. Since
there are 6 teams, at first glance it looks as if there are ![]() ![]() You might be able to see now that for 10 teams there would be ![]() |
|
Back to Top
|