Forming incongruent triangles

Правка en3, от Samin_Mustakim, 2024-08-29 22:26:35

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:

$$$\begin{align}x = \sum_{i=1}^{n} i \cdot \left\lceil \frac{i+1}{2} \right\rceil + 2 \cdot \sum_{i=1}^{n} \left\lceil \frac{i+1}{2} \right\rceil - \sum_{i=1}^{n} \left\lceil \frac{i+1}{2} \right\rceil^2 - n(n+1)\newline \end{align}$$$

However, I am not satisfied with this expression. Can it be simplified? (Can we express this equation without using the summation sign?)

Теги combinatorics, counting

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский Samin_Mustakim 2024-08-29 22:26:35 58
en2 Английский Samin_Mustakim 2024-08-29 22:26:18 91
en1 Английский Samin_Mustakim 2024-08-29 22:09:35 602 Initial revision (published)