Hey Brilliantinians, here I'm posting the most beautiful problem I've ever seen. The idea is that everyone can share the most interesting/beautiful/awesome problem he/she has ever faced to. The problem needs not to come from Brilliant. Solutions to the problems are also accepted in the comments
Here's mine. Let \(p\geq 3\) be a prime number. We divide every side of a triangle in \(p\) equal parts and every point of division is connected to the opposite vertex. Compute the maximum number of pairwise disjoint parts in which the triangle is divided in funciton of \(p\).