{"id":21614,"date":"2025-09-15T09:05:35","date_gmt":"2025-09-15T14:05:35","guid":{"rendered":"https:\/\/blog.espol.edu.ec\/algoritmos101\/?p=21614"},"modified":"2026-04-30T22:24:40","modified_gmt":"2026-05-01T03:24:40","slug":"3eva2025paoi_t3-numero-perfecto-funcion","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-3eva30\/3eva2025paoi_t3-numero-perfecto-funcion\/","title":{"rendered":"3Eva2025PAOI_T3 N\u00famero perfecto funci\u00f3n"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">3ra Evaluaci\u00f3n 2025-2026 PAOI, Septiembre 12, 2025 \/CCPG1043\/CCPG1801<\/h2>\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><strong>Tema 3.a<\/strong> (20 pts) implemente la funci\u00f3n <strong>es_perfecto<\/strong>(<em>n<\/em>) que reciba un n\u00famero n entero mayor a 1. La funci\u00f3n debe devolver True si <strong><em>n<\/em><\/strong> es un n\u00famero perfecto, o False en caso contrario.<\/p>\n\n\n\n<p>Un n\u00famero es perfecto cuando la suma de sus divisores propios (todos los divisores positivos distintos del propio n\u00famero) es igual a \u00e9l mismo.<\/p>\n\n\n\n<p>Ejemplos:<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><thead><tr><th>N\u00famero<\/th><th>Divisores propios<\/th><th>Suma<\/th><th>Perfecto<\/th><\/tr><\/thead><tbody><tr><td>2<\/td><td>1<\/td><td>1<\/td><td>No<\/td><\/tr><tr><td>3<\/td><td>1<\/td><td>1<\/td><td>No<\/td><\/tr><tr><td>4<\/td><td>1, 2<\/td><td>3<\/td><td>No<\/td><\/tr><tr><td>5<\/td><td>1<\/td><td>1<\/td><td>No<\/td><\/tr><tr><td>6<\/td><td>1, 2, 3<\/td><td>6<\/td><td>S\u00ed<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p><strong>Tema 3.b<\/strong> (10 puntos) Escriba un programa que: <\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>Solicite el ingreso de un n\u00famero por teclado.<\/li>\n\n\n\n<li>Valide hasta que el valor ingresado sea un n\u00famero entero mayor a 1. Considere que el usuario podr\u00eda ingresar cualquier tipo de caracter por teclado.<\/li>\n\n\n\n<li>Muestre cu\u00e1ntos n\u00fameros perfectos existen entre 2 y el n\u00famero ingresado inclusive<\/li>\n<\/ul>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<p><strong>Referencia<\/strong>: <a href=\"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-evalua\/fp-2e05\/2eva2002tii_t1-numero-perfecto\/\" data-type=\"post\" data-id=\"2843\">2Eva2002TII_T1 Verificar si es \"N\u00famero perfecto\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>3ra Evaluaci\u00f3n 2025-2026 PAOI, Septiembre 12, 2025 \/CCPG1043\/CCPG1801 Tema 3.a (20 pts) implemente la funci\u00f3n es_perfecto(n) que reciba un n\u00famero n entero mayor a 1. La funci\u00f3n debe devolver True si n es un n\u00famero perfecto, o False en caso contrario. Un n\u00famero es perfecto cuando la suma de sus divisores propios (todos los divisores [&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":[123],"tags":[155,162],"class_list":["post-21614","post","type-post","status-publish","format-standard","hentry","category-fp-3eva30","tag-funciones","tag-residuos"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/21614","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=21614"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/21614\/revisions"}],"predecessor-version":[{"id":21621,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/21614\/revisions\/21621"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=21614"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=21614"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=21614"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}