A ticket for the tram costs 1 leva. On the queue in front of the ticket seller are standing $n$ people with a banknote of 1 leva and $m$ people with a banknote of 2 leva. The ticket seller has no money in his cash deck so he can only sell a ticket to a buyer with a banknote of 2 leva, if he has at least 1 banknote of 1 leva. Determine the probability that the ticket seller could sell tickets to all of the people standing in the queue.
Problem
Source: III International Festival of Young Mathematicians Sozopol 2012, Theme for 10-12 grade
Tags: combinatorics