{"id":3208,"date":"2014-03-10T08:30:19","date_gmt":"2014-03-10T13:30:19","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3208"},"modified":"2025-12-10T08:24:02","modified_gmt":"2025-12-10T13:24:02","slug":"1eva2010ti_t2-numero-omirp","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva10\/1eva2010ti_t2-numero-omirp\/","title":{"rendered":"1Eva2010TI_T2 N\u00famero Omirp"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"1EvaIT2010\">1ra Evaluaci\u00f3n I T\u00e9rmino 2010-2011. Julio 6, 2010 \/ICM00794<\/h2>\n\n\n\n<figure class=\"wp-block-image alignright size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"207\" height=\"155\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/numero_OMIRP.png\" alt=\"n\u00famero OMIRP\" class=\"wp-image-16443\" \/><\/figure>\n\n\n\n<p><strong>Tema 2<\/strong>. (25 puntos) <strong>Omirp<\/strong> se define como,<br>un n\u00famero primo que al invertir sus d\u00edgitos da otro n\u00famero primo.<\/p>\n\n\n\n<p>Escriba un algoritmo para determinar si un n\u00famero <strong>n<\/strong> tiene la caracter\u00edstica de ser un n\u00famero <strong>Omirp<\/strong>.<\/p>\n\n\n\n<p><em><strong>Ejemplo<\/strong>:<\/em><\/p>\n\n\n\n<pre class=\"wp-block-code\"><code><em> 1597 es n\u00famero primo,\n Se invierte sus d\u00edgitos: 7951\n 7951 es primo,\n Entonces el n\u00famero 1597 es un n\u00famero omirp.<\/em><\/code><\/pre>\n\n\n\n<p><i><strong>R\u00fabrica<\/strong>: Validar si n es primo (7 puntos), invertir los d\u00edgitos del n\u00famero (10 puntos), validar si el nuevo n\u00famero es primo (3 puntos), respuesta y algoritmo integrado (5 puntos)<\/i><\/p>\n","protected":false},"excerpt":{"rendered":"<p>1ra Evaluaci\u00f3n I T\u00e9rmino 2010-2011. Julio 6, 2010 \/ICM00794 Tema 2. (25 puntos) Omirp se define como,un n\u00famero primo que al invertir sus d\u00edgitos da otro n\u00famero primo. Escriba un algoritmo para determinar si un n\u00famero n tiene la caracter\u00edstica de ser un n\u00famero Omirp. Ejemplo: R\u00fabrica: Validar si n es primo (7 puntos), invertir [&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":[145,158,162],"class_list":["post-3208","post","type-post","status-publish","format-standard","hentry","category-fp-1eva10","tag-acumuladores","tag-lazos-bucles","tag-residuos"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3208","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=3208"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3208\/revisions"}],"predecessor-version":[{"id":16444,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3208\/revisions\/16444"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3208"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3208"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3208"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}