number theory

shahar

Full Member
Joined
Jul 19, 2018
Messages
524
How it is possible to prove that the formula:
n(n-3)/2 is always even?
 
OK. I have a typo, the correct version is (5(n-3))/2.
This is the formula of number of the diagnols of any polygon.
That's not always even either. Eg n=5.
A pentagon has 5 diagonals. That's not even.
The formula for the number of diagonals in a polygon was correct in your first post, ie n(n-3)/2.
 
That's not always even either. Eg n=5.
A pentagon has 5 diagonals. That's not even.
The formula for the number of diagonals in a polygon was correct in your first post, ie n(n-3)/2.
O.K. Here what I want to ask - why the solution is always whole number?
 
n(n-3)/2

If n is odd, then n-3 is even, so n (n-3) is even, and so divisible by 2. Therefore n(n-3)/2 is a whole number.

If n is even, .... you can finish off the proof from here.
 
I would only add a condition n>3
Actually, the formula works for n3n\ge3, since it correctly says that a triangle has no diagonals!

And since we usually don't consider a monogon or digon to be polygons, though the words do exist, even this isn't a serious restriction.

How it is possible to prove that the formula:
n(n-3)/2 is always even?
I take it that you meant to say it "always divides evenly". I imagine English isn't the only language in which "even" can be confusing that way!
 
OK. I have a typo, the correct version is (5(n-3))/2.
This is the formula of number of the diagnols of any polygon.
Since 2 and 5 have no common factors other than 1, having the 5 in 5(n-3)/2 will not change whether or not 5(n-3)/2 is a whole number (that is the same as saying that 5(n-3) is even). If 5(n-3) is in fact even, then it is because n-3 is even. n-3 being even depends on the parity of n meaning that it is not always even.
 
Top