Example of Memorylessness of a Poisson process Could someone please clarify the following example (it is taken from Introduction to Probability by Bertsekas):
When you enter the bank, you find that all three tellers are busy serving other customers, and there are no other customers in queue. Assume that the service times for you and for each of the customers being served are iid exponential random variables. What is the probability that you will be the last to leave?
The answer is 1 /3. Focus at the moment when you start service with one of the tellers. Then, the remaining time of each of the other two customers being served, as well as your own remaining time, have the same PDF. Therefore,
you and the other two customers have equal probability 1/3 of being the last to
leave.
When I think about it I get the following. Assume that the service time has PDF of Exponential(0.5). One customer has been served for 3 minutes. Then, according to Exponential(0.5), the probability of success (the probability that he leaves the bank) during the 4th minute is P(X < 4) = 0.86. 
Next, my service time begins at that moment. So, I use Exponential(0.5) to calculate the probability of my success during my 1st minute, which is P(X < 1) = 0.39. 
0.39 does not equal to 0.86. So, how is it possible that the other customer and I have the same probability of being the last to leave the bank?
 A: The memoryless property here means that if the expected waiting time for a new arrival is $\lambda$ and it has already been $t$ since the last event, the expected waiting time is still $\lambda$ and not $\lambda - t$. 
In the case of your specific example, the "event" that you are waiting for is for a given teller to become available. To translate this into the context of the memoryless property, it means that regardless of how long each of those individual customers has already been talking to their teller prior to your arrival, your estimate is that it will take $\lambda$ time for a teller to become available. When that happens, we have a new observation for the process, you step up to be served and the clock starts all over again for all three tellers. It doesn't matter how long they've already been working with that particular client, all we know is that their window still isn't open and it takes on average an additional $\lambda$ amount time for any teller to become available regardless of how long they've already been at work on a particular customer. Therefore, our estimate of how long it will take for any of the three current customers to get served is the same, so each has an equal chance of being the next one served and, equivalently, the last one to leave.
