Your title here...
------------------**Problem:** There are $$$n$$$ sticks of length $$$1,2,3,...,n$$$. How many incongruent triangles can be formed by using three of the given sticks?
My solution: After solving the problem, I found the number of triangles, $$$x$$$, to be:
However, I am not satisfied with this expression. Can it be simplified? (Can we express this equation without using the summation sign?)