Hello. I try to understand what iterative procedure should I use. Please, take a look at the link to get a description of the task. https://www.dropbox.com/s/esxzot2bemhq2oi/bound.PDF?dl=0 So k is a number of error taints. ? is the code below
c1 = NSolve[
Sum[PDF[BinomialDistribution[n, p1], i], {i, k, m}] == a &&
1 >= p1 >= 0, p1]; p1 = p1 /. c1[[1]];
I understand that we should use k iterations. But I dont fully understand what does mean ?k =max[?k (1) , ?k (2)] to find some maximum. Sopose we have n=100 and three taints t=20,30,40. Chould you give me a hint on how it should look at mathematica? Thanks in advance.