Exercise: Recursive jar
Two players take turns removing a ball from a jar that initially contains \(m\) white and \(n\) black balls. The first player to remove a white ball wins. Develop a recursive formula that allows the convenient computation of the probability that the starting player wins.