{"id":3109,"date":"2014-03-03T19:05:12","date_gmt":"2014-03-04T00:05:12","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=3109"},"modified":"2026-04-05T06:43:34","modified_gmt":"2026-04-05T11:43:34","slug":"1eva2003tiii_t2-numeros-triangulares","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-1eva10\/1eva2003tiii_t2-numeros-triangulares\/","title":{"rendered":"1Eva2003TIII_T2 Verificar n\u00fameros triangulares"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Parcial III T\u00e9rmino 2003 - 2004. Abril 02, 2004 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 2.<\/strong> (25 puntos) Considere la secuencia de n\u00fameros triangulares, cuyo nombre refleja su ley de formaci\u00f3n:<\/p>\n\n\n\n<p class=\"has-text-align-center\">1, 3, 6, 10, ...<\/p>\n\n\n\n<figure class=\"wp-block-image size-full\"><img loading=\"lazy\" decoding=\"async\" width=\"529\" height=\"192\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2017\/10\/EstructuraRepetir_03.png\" alt=\"N\u00famero triangular\" class=\"wp-image-4391\" \/><\/figure>\n\n\n\n<p>Escriba un algoritmo en seudo-c\u00f3digo que indique si un n\u00famero natural <strong>t<\/strong>, ingresado por teclado, es triangular.<\/p>\n\n\n\n<p>Esto es, si es de la forma:<\/p>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> t = \\sum_{i=1}^{n}i <\/span>\n\n\n\n<p class=\"has-text-align-center\">para alg\u00fan n\u00famero natural<strong> n<\/strong><\/p>\n\n\n\n<p><em><strong>R\u00fabrica<\/strong><\/em>: identificaci\u00f3n de piso en operaci\u00f3n (5 puntos), c\u00e1lculo de usados (5 puntos), control de pisos construidos (5 puntos), validar suma t es triangular (5 puntos), algoritmo estructurado (5 puntos)<\/p>\n\n\n\n<p><em><strong>Referencia<\/strong><\/em>: <a href=\"https:\/\/es.wikipedia.org\/wiki\/N%C3%BAmero_triangular\">N\u00famero triangular. Wikipedia<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Parcial III T\u00e9rmino 2003 - 2004. Abril 02, 2004 \/ICM00794 Tema 2. (25 puntos) Considere la secuencia de n\u00fameros triangulares, cuyo nombre refleja su ley de formaci\u00f3n: 1, 3, 6, 10, ... Escriba un algoritmo en seudo-c\u00f3digo que indique si un n\u00famero natural t, ingresado por teclado, es triangular. Esto es, si es de la [&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],"class_list":["post-3109","post","type-post","status-publish","format-standard","hentry","category-fp-1eva10","tag-acumuladores","tag-lazos-bucles"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3109","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=3109"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3109\/revisions"}],"predecessor-version":[{"id":16366,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/3109\/revisions\/16366"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=3109"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=3109"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=3109"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}