Help solving the explicit solution for the following recursive expression:
Expand Post »
Hello,
here i need to find the explicit solution for the following recursive expression: (Thanks for any suggestions)
A diagonal in a polygon it is a line of a vertex to another vertex that is not adjacent. For example, a triangle does not have diagonals. Find the number of diagonals in a polygon of n sides where n >= 3.
No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.
This thread is currently closed and is not accepting any new replies.
Previous Thread in Computer Science Forum Timeline:What is Big O ?
Unsolved 
