概率知识点整理及其相关习题解析（Probabilistic knowledge point arrangement and related exercises analysis）.docVIP

下载本文档

0
0
约1.49万字
约 17页
2017-09-28 发布于河南
举报
版权申诉

概率知识点整理及其相关习题解析（Probabilistic knowledge point arrangement and related exercises analysis）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

概率知识点整理及其相关习题解析（Probabilistic knowledge point arrangement and related exercises analysis）

概率知识点整理及其相关习题解析（Probabilistic knowledge point arrangement and related exercises analysis） 1. n balls randomly into N (N = n) a box to find the probability of each box has at most one ball (not limited to set box capacity). Solution: put the N ball into the N box, each drop is a basic event. This is easy, the problems of classical probability, because each ball can be placed in any box N box, thus the total of N * N * N *. Put differently, and each box up to a ball a total of N (N-1)..[N- (n-1)] on the different method. So the p=N probability (N-1). (N-n+1) / (N^n) / =N! (n! (N-n)! (N^n)). Knowledge point: classical probability. Classical probability [equal probability model] characteristics: The sample space of the *1 test contains only a limited number of elements; In the *2 test, the likelihood of each basic event is the same. With 2. N products, including D defective goods, taken from this n, which asked exactly k (k = D) the probability of defective goods? Solution: in the N product extracted n (here refers to sampling without replacement), all were taken may have C[n][N] [n N] a superscript subscript, each method is a basic event, and because the symmetry of the possibility of each basic event occurred that same, because K in D defective, all law may have C[k][D], N-D and n-k in the piece of authentic pieces from all possible C[n-k][N-D], n know by the multiplication principle in N device, which just happens to have common K defective product has C[k][D]C[n-k][N-D], so the probability of p=C[k][D]C[n-k][N-D]/C[n][N] Point of knowledge: multiplication principle, hypergeometric probability. In 3. random integer of 1~2000 in one, ask the integer is not divisible by 6, and the probability can not be divisible by 8? Solution: if A is an event, the number that gets can be divisible by 6. B is the event, the number that gets can be divisible by 8, and the probability is: P (A B =P (!!)! (A, B)) =1-P (A, B) [A A, A+B! A and B] and events =1-[P (A), +P (B), -P (AB)] Bec