4.19. Computer Challenge. Let N be a positive integer and let Z . . . , Z be independent random variables, each having the geometric distribution

Since these are discrete random variables, the maximum among them may be unique, or there may be ties for the maximum. Let p,,, be the probability that the maximum is unique. How does p,,, behave when N is large? (Alternative formulation: You toss N dimes. Those that are heads you set aside; those that are tails you toss again. You repeat this until all of the coins are heads. Then p, is the probability that the last toss was of a single coin.)

Pr{Z = k) = ( ). for k = 1, 2, ....