🦘 Math Kangaroo Grade All Felix 1-2 Ecolier 3-4 Benjamin 5-6 Kadett 7-8 Junior 9-10 Student 11-12 ⇄ switch contest
2009 Math Kangaroo

Problem 2

Problem 2 · 2009 Math Kangaroo Medium
Counting & Probability careful-countingspatial-reasoning

What is the minimum number of points that must be removed from the diagram shown so that no three of the remaining points lie on one line?

Figure for Math Kangaroo 2009 Problem 2
Show answer
Answer: C — 3
Show hints
Hint 1 of 2
List every straight line of three dots in the 3×3 array — rows, columns, and the two diagonals.
Still stuck? Show hint 2 →
Hint 2 of 2
Find the largest set of dots with no three in a line; the answer is 9 minus that.
Show solution
Approach: find the most dots you can keep, then subtract
  1. The 3×3 array of 9 dots has lines of three along 3 rows, 3 columns, and 2 diagonals.
  2. If you keep 7 or more dots, some full line of three survives, so 7 is too many to keep.
  3. You can keep 6 dots with no three in a line: remove the three dots of one diagonal, leaving two dots in every row and column.
  4. So the fewest removals is 9 − 6 = 3.
Mark: · log in to save