Hi Mei Ping
This is known as the complement method (or in layman's term, "back door" approach).
Firstly, I imagine all the points are joined to every other points i.e. the "boundary" of the shape is included. There are n sides.
Calculating this is not difficult. This is similar to a common kind of question which goes like this:
"There are n people in a party. If everyone shakes hands with everybody else, how many handshakes are there in total?"
Each person will shake hands with (n-1) people. So all n of them will do that.
At first glance, total handshakes = n(n-1). On closer scrutiny, you should realise that you have double counted every handshake. (Think: A shakes hand with B and B shakes hand with A refer to the same handshake!)
Realising this fact, we can either use n(n-1) Γ· 2 to get the answer or
simply count as follows:
1+2+3+...+n-1 which gives the same answer.
Then, we must minus the n we had added to simplify the problem.
Hope this helps.
P.S. Actually, if we use algebra to simply & generalise the expression, you will get
(1+2+3+...+n-1) - n
= n(n-1) Γ· 2 - n
= n(n-3) Γ· 2
6 years ago
Raymond Ng
Alternatively, if you prefer a direct approach, think of it this way:
Every person (point) can shake hand with everyone at the party (diagram) except for itself & it's left and right neighbours.
So if there are n persons (points) there are (n-3) handshakes per person. Total = n(n-3) handshakes (lines). However, due to double counting (as explained above), answer = n(n-3) Γ·2
Hi Mei Ping
This is known as the complement method (or in layman's term, "back door" approach).
Firstly, I imagine all the points are joined to every other points i.e. the "boundary" of the shape is included. There are n sides.
Calculating this is not difficult. This is similar to a common kind of question which goes like this:
"There are n people in a party. If everyone shakes hands with everybody else, how many handshakes are there in total?"
Each person will shake hands with (n-1) people. So all n of them will do that.
At first glance, total handshakes = n(n-1). On closer scrutiny, you should realise that you have double counted every handshake. (Think: A shakes hand with B and B shakes hand with A refer to the same handshake!)
Realising this fact, we can either use n(n-1) Γ· 2 to get the answer or
simply count as follows:
1+2+3+...+n-1 which gives the same answer.
Then, we must minus the n we had added to simplify the problem.
Hope this helps.
P.S. Actually, if we use algebra to simply & generalise the expression, you will get
(1+2+3+...+n-1) - n
= n(n-1) Γ· 2 - n
= n(n-3) Γ· 2
6 years ago
Raymond Ng
Alternatively, if you prefer a direct approach, think of it this way:
Every person (point) can shake hand with everyone at the party (diagram) except for itself & it's left and right neighbours.
So if there are n persons (points) there are (n-3) handshakes per person. Total = n(n-3) handshakes (lines). However, due to double counting (as explained above), answer = n(n-3) Γ·2