{"id":2550,"date":"2014-09-07T21:00:59","date_gmt":"2014-09-08T02:00:59","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2550"},"modified":"2026-04-05T07:35:21","modified_gmt":"2026-04-05T12:35:21","slug":"3eva2006tii_t3-numeros-primos-mas-cercanos","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-3eva10\/3eva2006tii_t3-numeros-primos-mas-cercanos\/","title":{"rendered":"3Eva2006TII_T3 N\u00fameros Primos m\u00e1s cercanos"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"3EvaIIT2006\">3ra Evaluaci\u00f3n II T\u00e9rmino 2006-2007, Febrero 6, 2007 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 3<\/strong>. (30 Puntos) Dada una lista de <strong>n<\/strong>\u00a0n\u00fameros, obtener el n\u00famero primo m\u00e1s cercano a cada uno de los n\u00fameros. En caso de que el n\u00famero de la lista sea un n\u00famero primo, ese n\u00famero es el m\u00e1s cercano.<br><em><br><\/em>a. Escriba una funci\u00f3n <strong>primo(n)<\/strong> que determine si el numero n es primo.<\/p>\n\n\n\n<p>b. Realice un programa que revise de una lista, los n\u00fameros enteros, los inmediatos inferiores y superiores hasta encontrar un n\u00famero primo y llene la tabla resultante.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table><thead><tr><th>N\u00fameros<\/th><th>.<\/th><th>Primo superior<\/th><th>Primo inferior<\/th><\/tr><\/thead><tbody><tr><td>100<\/td><td>\u2192<\/td><td>101<\/td><td>97<\/td><\/tr><tr><td>246<\/td><td>\u2192<\/td><td>251<\/td><td>241<\/td><\/tr><tr><td>2<\/td><td>\u2192<\/td><td>2<\/td><td>&nbsp;<\/td><\/tr><tr><td>333<\/td><td>\u2192<\/td><td>337<\/td><td>331<\/td><\/tr><tr><td>2007<\/td><td>\u2192<\/td><td>2011<\/td><td>2003<\/td><\/tr><\/tbody><\/table><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>3ra Evaluaci\u00f3n II T\u00e9rmino 2006-2007, Febrero 6, 2007 \/ICM00794 Tema 3. (30 Puntos) Dada una lista de n\u00a0n\u00fameros, obtener el n\u00famero primo m\u00e1s cercano a cada uno de los n\u00fameros. En caso de que el n\u00famero de la lista sea un n\u00famero primo, ese n\u00famero es el m\u00e1s cercano.a. Escriba una funci\u00f3n primo(n) que determine [&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":[120],"tags":[149,155],"class_list":["post-2550","post","type-post","status-publish","format-standard","hentry","category-fp-3eva10","tag-arreglos-vectores","tag-funciones"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2550","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=2550"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2550\/revisions"}],"predecessor-version":[{"id":17151,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2550\/revisions\/17151"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2550"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2550"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2550"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}