K
khorne
Guest
Hey all
I have a problem, as follows:
How many diagonals are there in a polygon with n sides...
Now I can solve it as an algebraic expression, i.e n = (number of verticies/sides)
thus n(n-3)/ 2 -> (can't join itself or adjacent vertices) (and the 2 is the repeats (going back and forth))
However, I am not sure how to solve this in the context of combinatorics...Can anyone lend a hand please?
Never mind -Solved-
I have a problem, as follows:
How many diagonals are there in a polygon with n sides...
Now I can solve it as an algebraic expression, i.e n = (number of verticies/sides)
thus n(n-3)/ 2 -> (can't join itself or adjacent vertices) (and the 2 is the repeats (going back and forth))
However, I am not sure how to solve this in the context of combinatorics...Can anyone lend a hand please?
Never mind -Solved-
Last edited by a moderator: