Question 2 (1 point)
If you place 35 points on a piece of paper so that no three points are collinear, how many line segments are necessary to connect each point to all the others?
Fill in the table, and write a function rule for the number of segments required to connect n points. Then find the number of segments necessary to connect 35 points
2
Points 1
Segments 0 1
f(3) =
f(4) =
Is the function rule linear?
f(n) =
It takes
3
4
f(5)=
5
(Yes or No)
***
(enter WITHOUT spaces)
segments to connect 35 points.
n
...
35