For instance if n=1 P=1 for P1=1 , while P=0 for P1=0
If n=2, and say P1=0.5, P2=0.7, then P=0.85
P= 1 - ∏i=1..2(1-Pi) = 1 - (1-P1)(1-P2) = 1 - (1-0.5)(1-0.7) = 1 - 0.15 = 0.85
Take P1 = P2 = P3 = 0.9 and you will get P>1 which is impossible.
I will think about N- out -of -M -solution in general case which should include also the calculation of probability to lose the specific set of N from all possible combinations.
So it must be
PL2K = P1P2 + P2P3 + P1P3 + P1P2P3 - 3P1P2P3 = P1P2 + P2P3 + P1P3 - 2P1P2P3