863
个编辑
更改
跳到导航
跳到搜索
第436行：
第436行： − − − − <math> &= \sum_{k=m}^n \binom{n}{k} \binom{k}{m} p^k q^m (1-p)^{n-k} (1-q)^{k-m}</math> 第452行：
第448行： − − <math>\Pr[Y = m] &= \binom{n}{m} p^m q^m \left( \sum_{k=m}^n \binom{n-m}{k-m} p^{k-m} (1-p)^{n-k} (1-q)^{k-m} \right) \\[2pt]}</math><ref><nowiki>{{cite book</nowiki> − − <math> &= \binom{n}{m} (pq)^m \left( \sum_{k=m}^n \binom{n-m}{k-m} \left(p(1-q)\right)^{k-m} (1-p)^{n-k} \right)</math> − − | chapter =Confidence intervals − − − | chapter-url =http://www.itl.nist.gov/div898/handbook/prc/section2/prc241.htm − − After substituting i = k - m in the expression above, we get − − | title =Engineering Statistics Handbook − − \Pr[Y = m] = \binom{n}{m} (pq)^m \left( \sum_{i=0}^{n-m} \binom{n-m}{i} (p - pq)^i (1-p)^{n-m - i} \right) − − | publisher =NIST/Sematech − − Notice that the sum (in the parentheses) above equals (p - pq + 1 - p)^{n-m} by the binomial theorem. Substituting this in finally yields − − | year =2012 − − 1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3 − − | access-date =2017-07-23 − − <nowiki>}}</nowiki></ref>
→威尔逊法
由于X <math>\sim B(n, p)</math>和Y <math>\sim B(X, q)</math>，由<font color="#ff8000">全概率公式 the law of total probability </font>,
由于X <math>\sim B(n, p)</math>和Y <math>\sim B(X, q)</math>，由<font color="#ff8000">全概率公式 the law of total probability </font>,
<math> \widehat{p\,} + \frac{z^2}{2n} + z</math>
<math> \widehat{p\,} + \frac{z^2}{2n} + z</math>
<math>\frac{\widehat{p\,}(1 - \widehat{p\,})}{n} </math>
<math>\frac{\widehat{p\,}(1 - \widehat{p\,})}{n} </math>
<math> 1 + \frac{z^2}{n}</math>
<math> 1 + \frac{z^2}{n}</math>
====比较====
====比较====