{"id":2843,"date":"2014-03-02T16:00:55","date_gmt":"2014-03-02T21:00:55","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2843"},"modified":"2026-04-05T07:05:27","modified_gmt":"2026-04-05T12:05:27","slug":"2eva2002tii_t1-numero-perfecto","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2002tii_t1-numero-perfecto\/","title":{"rendered":"2Eva2002TII_T1 Verificar si es \"N\u00famero perfecto\""},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIIT2002\">Final II T\u00e9rmino 2002 \u2013 2003. Febrero 13, 2002 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 1<\/strong>. (20 puntos) Un n\u00famero perfecto es aquel que es igual a la suma de todos sus divisores, con excepci\u00f3n del mismo.<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>Ejemplo:\n 6 es <em>perfecto<\/em> porque, \n   sus divisores son: 1, 2, 3 (6 no se considera).\n   1+2+3=6<\/code><\/pre>\n\n\n\n<figure class=\"wp-block-image alignright size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"343\" height=\"250\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2014\/03\/NumeroPerfecto01.png\" alt=\"Numero Perfecto\" class=\"wp-image-16707\" \/><\/figure>\n\n\n\n<p>a) Defina una <i>funci\u00f3n<\/i> llamada <strong>perfecto(x)<\/strong> que retorne <strong>1<\/strong> si <strong>x<\/strong> es un n\u00famero perfecto o <strong>0<\/strong> en caso de que no lo sea.<\/p>\n\n\n\n<p>b) Para probar la <i>funci\u00f3n,<\/i> genere en el <i>programa<\/i> principal <strong>m<\/strong> pares de n\u00fameros aleatorios con valores entre 1 y <strong>n<\/strong> inclusive (<strong>m<\/strong> y <strong>n<\/strong> deben ser previamente pedidos por teclado), y muestre cu\u00e1ntas de estas parejas tienen su suma igual a un n\u00famero perfecto.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Final II T\u00e9rmino 2002 \u2013 2003. Febrero 13, 2002 \/ICM00794 Tema 1. (20 puntos) Un n\u00famero perfecto es aquel que es igual a la suma de todos sus divisores, con excepci\u00f3n del mismo. a) Defina una funci\u00f3n llamada perfecto(x) que retorne 1 si x es un n\u00famero perfecto o 0 en caso de que no [&hellip;]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"wp-custom-template-entrada-fp-ejercicios","format":"standard","meta":{"footnotes":""},"categories":[93],"tags":[145,155],"class_list":["post-2843","post","type-post","status-publish","format-standard","hentry","category-fp-2eva10","tag-acumuladores","tag-funciones"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2843","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=2843"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2843\/revisions"}],"predecessor-version":[{"id":21616,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2843\/revisions\/21616"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2843"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2843"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2843"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}