{"id":805,"date":"2016-09-24T07:35:19","date_gmt":"2016-09-24T12:35:19","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/estg1003\/?p=805"},"modified":"2026-04-12T13:23:14","modified_gmt":"2026-04-12T18:23:14","slug":"2eva2009tii_t2-fiec-teorema-limite-central","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/stp-2eva\/2eva2009tii_t2-fiec-teorema-limite-central\/","title":{"rendered":"2Eva2009TII_T2 FIEC teorema limite central"},"content":{"rendered":"\n

2da Evaluaci\u00f3n II T\u00e9rmino 2009-2010. Febrero 4, 2010 . FIEC03236<\/h2>\n\n\n\n

Tema 2<\/strong> (20 puntos). Se  ha calculado la suma de una lista de 100 n\u00fameros reales .<\/p>\n\n\n\n

Suponga que los n\u00fameros se redondean al entero m\u00e1s cercano de tal manera que cada n\u00famero tiene un error que est\u00e1 distribuido uniformemente en el intervalo (-0.5, 0.5).<\/p>\n\n\n\n

Usando el teorema del l\u00edmite central estime la probabilidad de que el error en la suma exceda de 6.<\/p>\n\n\n Q(x) = \\frac{1}{\\sqrt{2 \\pi}} \\int_{x}^{\\infty} e^{-t^2 \/2} dt<\/span>\n\n\n\n

x<\/th>Q(x)<\/th> <\/th>x<\/th>Q(x)<\/th><\/tr>
0<\/td>5.00E-01<\/td> <\/td>2.7<\/td>3.47E-03<\/td><\/tr>
0.1<\/td>4.60E-01<\/td> <\/td>2.8<\/td>2.56E-03<\/td><\/tr>
0.2<\/td>4.21E-01<\/td> <\/td>2.9<\/td>1.87E-03<\/td><\/tr>
0.3<\/td>3.82E-01<\/td> <\/td>3.0<\/td>1.35E-03<\/td><\/tr>
0.4<\/td>3.45E-01<\/td> <\/td>3.1<\/td>9.68E-04<\/td><\/tr>
0.5<\/td>3.09E-01<\/td> <\/td>3.2<\/td>6.87E-04<\/td><\/tr>
0.6<\/td>2.74E-01<\/td> <\/td>3.3<\/td>4.83E-04<\/td><\/tr>
0.7<\/td>2.42E-01<\/td> <\/td>3.4<\/td>3.37E-04<\/td><\/tr>
0.8<\/td>2.12E-01<\/td> <\/td>3.5<\/td>2.33E-04<\/td><\/tr>
0.9<\/td>1.84E-01<\/td> <\/td>3.6<\/td>1.59E-04<\/td><\/tr>
1.0<\/td>1.59E-01<\/td> <\/td>3.7<\/td>1.08E-04<\/td><\/tr>
1.1<\/td>1.36E-01<\/td> <\/td>3.8<\/td>7.24E-05<\/td><\/tr>
1.2<\/td>1.15E-01<\/td> <\/td>3.9<\/td>4.81E-05<\/td><\/tr>
1.3<\/td>9.68E-02<\/td> <\/td>4.0<\/td>3.17E-05<\/td><\/tr>
1.4<\/td>8.08E-02<\/td> <\/td>4.5<\/td>3.40E-06<\/td><\/tr>
1.5<\/td>6.68E-02<\/td> <\/td>5.0<\/td>2.87E-07<\/td><\/tr>
1.6<\/td>5.48E-02<\/td> <\/td>5.5<\/td>1.90E-08<\/td><\/tr>
1.7<\/td>4.46E-02<\/td> <\/td>6.0<\/td>9.87E-10<\/td><\/tr>
1.8<\/td>3.59E-02<\/td> <\/td>6.5<\/td>4.02E-11<\/td><\/tr>
1.9<\/td>2.87E-02<\/td> <\/td>7.0<\/td>1.28E-12<\/td><\/tr>
2.0<\/td>2.28E-02<\/td> <\/td>7.5<\/td>3.19E-14<\/td><\/tr>
2.1<\/td>1.79E-02<\/td> <\/td>8.0<\/td>6.22E-16<\/td><\/tr>
2.2<\/td>1.39E-02<\/td> <\/td>8.5<\/td>9.48E-18<\/td><\/tr>
2.3<\/td>1.07E-02<\/td> <\/td>9.0<\/td>1.13E-19<\/td><\/tr>
2.4<\/td>8.20E-03<\/td> <\/td>9.5<\/td>1.05E-21<\/td><\/tr>
2.5<\/td>6.21E-03<\/td> <\/td>10.0<\/td>7.62E-24<\/td><\/tr>
2.6<\/td>4.66E-03<\/td> <\/td> <\/td> <\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"

2da Evaluaci\u00f3n II T\u00e9rmino 2009-2010. Febrero 4, 2010 . FIEC03236 Tema 2 (20 puntos). Se  ha calculado la suma de una lista de 100 n\u00fameros reales . Suponga que los n\u00fameros se redondean al entero m\u00e1s cercano de tal manera que cada n\u00famero tiene un error que est\u00e1 distribuido uniformemente en el intervalo (-0.5, 0.5). […]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-stp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[210],"tags":[223],"class_list":["post-805","post","type-post","status-publish","format-standard","hentry","category-stp-2eva","tag-funcion-densidad"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/805","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/users\/8043"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/comments?post=805"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/805\/revisions"}],"predecessor-version":[{"id":23518,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/805\/revisions\/23518"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=805"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=805"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=805"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}