The t=1 case is simply the tautology that the procedure always terminates iff the procedure always terminates. t=1 is always a trivial solution to the recurrence relation. If n (1-p) < 1, you expect ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results