A diagonal of a convex pentagon is a line segment that connects two non-adjacent vertices of the pentagon. There are five vertices in a convex pentagon, and each vertex can be connected to two other non-adjacent vertices by a diagonal. However, this counts each diagonal twice, once for each endpoint. To avoid double-counting, we can divide the total number of possible diagonals by 2. This gives us 10 divided by 2, or 5, distinct diagonals that can be drawn in a convex pentagon. 
How many distinct diagonals of a convex pentagon can be drawn?