{"id":3172,"date":"2014-03-08T08:30:02","date_gmt":"2014-03-08T13:30:02","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3172"},"modified":"2025-12-10T09:06:39","modified_gmt":"2025-12-10T14:06:39","slug":"1eva2008ti_t2-criba-de-eratostenes","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva10\/1eva2008ti_t2-criba-de-eratostenes\/","title":{"rendered":"1Eva2008TI_T2 Criba de Erat\u00f3stenes con Python"},"content":{"rendered":"\n<h3 class=\"wp-block-heading\" id=\"\u201d1EvaIT2008\u201d\">1ra Evaluaci\u00f3n I T\u00e9rmino 2008 - 2009. Julio 08, 2008 \/ICM00794<\/h3>\n\n\n\n<p><strong>Tema 2<\/strong> (20 puntos). Una forma de hallar todos los n\u00fameros primos menores que un n\u00famero natural <strong>n<\/strong>, es el m\u00e9todo de la \u201c<strong>Criba de Erat\u00f3stenes<\/strong>\u201d que consiste en lo siguiente:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Se forma un vector con todos los n\u00fameros naturales entre 2 y n.<\/li>\n\n\n\n<li>Se tachan todos los m\u00faltiplos de 2 que son menores que n,<\/li>\n\n\n\n<li>luego se tachan los m\u00faltiplos de 3 que son menores que n,<\/li>\n\n\n\n<li>y as\u00ed sucesivamente.<\/li>\n\n\n\n<li>El procedimiento se repite hasta alcanzar todos los m\u00faltiplos de los n\u00fameros naturales menores que n.<\/li>\n\n\n\n<li>Los n\u00fameros no tachados corresponden a los n\u00fameros primos.<\/li>\n<\/ul>\n\n\n\n<pre class=\"wp-block-code\"><code>Primos: 2, 3, 5, 7, 11, 13, 17, 19<\/code><\/pre>\n\n\n\n<p>Elabore un algoritmo que, dado un n\u00famero entero positivo n mayor que 1, muestre los n\u00fameros primos encontrados con el m\u00e9todo descrito. <\/p>\n\n\n\n<p>Ejemplo: Para n=20<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><th>i<\/th><th>criba[i]<\/th><\/tr><tr><td><strong>2<\/strong><\/td><td>1<\/td><\/tr><tr><td>3<\/td><td>1<\/td><\/tr><tr><td><strong>4<\/strong><\/td><td>0<\/td><\/tr><tr><td>5<\/td><td>1<\/td><\/tr><tr><td><strong>6<\/strong><\/td><td>0<\/td><\/tr><tr><td>7<\/td><td>1<\/td><\/tr><tr><td><strong>8<\/strong><\/td><td>0<\/td><\/tr><tr><td>9<\/td><td>0<\/td><\/tr><tr><td>10<\/td><td>0<\/td><\/tr><tr><td>11<\/td><td>1<\/td><\/tr><tr><td>12<\/td><td>0<\/td><\/tr><tr><td>13<\/td><td>1<\/td><\/tr><tr><td>14<\/td><td>0<\/td><\/tr><tr><td>15<\/td><td>0<\/td><\/tr><tr><td>16<\/td><td>0<\/td><\/tr><tr><td>17<\/td><td>1<\/td><\/tr><tr><td>18<\/td><td>0<\/td><\/tr><tr><td>19<\/td><td>1<\/td><\/tr><tr><td>20<\/td><td>0<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>1ra Evaluaci\u00f3n I T\u00e9rmino 2008 - 2009. Julio 08, 2008 \/ICM00794 Tema 2 (20 puntos). Una forma de hallar todos los n\u00fameros primos menores que un n\u00famero natural n, es el m\u00e9todo de la \u201cCriba de Erat\u00f3stenes\u201d que consiste en lo siguiente: Elabore un algoritmo que, dado un n\u00famero entero positivo n mayor que 1, [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[113],"tags":[149],"class_list":["post-3172","post","type-post","status-publish","format-standard","hentry","category-fp-1eva10","tag-arreglos-vectores"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3172","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=3172"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3172\/revisions"}],"predecessor-version":[{"id":16477,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3172\/revisions\/16477"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3172"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3172"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3172"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}