{"id":2863,"date":"2014-03-03T16:05:02","date_gmt":"2014-03-03T21:05:02","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2863"},"modified":"2026-04-05T07:07:14","modified_gmt":"2026-04-05T12:07:14","slug":"2eva2003tii_t2-mostrar-un-triangulo-de-pascal","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2003tii_t2-mostrar-un-triangulo-de-pascal\/","title":{"rendered":"2Eva2003TII_T2 Mostrar un tri\u00e1ngulo de Pascal"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIIT2003\">Final II T\u00e9rmino 2003 \u2013 2004. Febrero 10, 2004 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 2. <\/strong>Escriba un <i>algoritmo <\/i>que permita almacenar en una matriz las primeras <strong>n<\/strong> filas del tri\u00e1ngulo de pascal&nbsp; (<strong>n<\/strong>&lt;20).<\/p>\n\n\n\n<p>Muestre por pantalla la matriz de Pascal generada.<\/p>\n\n\n\n<figure class=\"wp-block-table\"><table class=\"has-fixed-layout\"><tbody><tr><td>1<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td>1<\/td><td>1<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td>1<\/td><td>2<\/td><td>1<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td>1<\/td><td><em><strong><mark style=\"background-color:#FFEE58\" class=\"has-inline-color\">3<\/mark><\/strong><\/em><\/td><td><em><strong><mark style=\"background-color:#FFEE58\" class=\"has-inline-color\">3<\/mark><\/strong><\/em><\/td><td>1<\/td><td>&nbsp;<\/td><td>&nbsp;<\/td><\/tr><tr><td>1<\/td><td>4<\/td><td><em><strong><mark style=\"background-color:#FFEE58\" class=\"has-inline-color\">6<\/mark><\/strong><\/em><\/td><td>4<\/td><td>1<\/td><td>&nbsp;<\/td><\/tr><tr><td>1<\/td><td>5<\/td><td>10<\/td><td>10<\/td><td>5<\/td><td>1<\/td><\/tr><tr><td>\u2026.<\/td><td>\u2026.<\/td><td>\u2026.<\/td><td>\u2026.<\/td><td>\u2026.<\/td><td>\u2026.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>A partir de la tercera fila, los elementos dentro del tri\u00e1ngulo se obtienen sumando los dos elementos anteriores de la fila anterior.<br>Por ejemplo, <em><strong>6<\/strong><\/em>=3+3.<\/p>\n\n\n\n<p><strong>Sugerencia<\/strong>: Usando una matriz cuadrada, en la primera columna y la diagonal llene de unos. Luego realice las operaciones en la parte triangular inferior.<\/p>\n\n\n\n<figure class=\"wp-block-embed is-type-video is-provider-youtube wp-block-embed-youtube wp-embed-aspect-16-9 wp-has-aspect-ratio\"><div class=\"wp-block-embed__wrapper\">\n<iframe loading=\"lazy\" title=\"Galton Board and Pascal&#039;s Triangle\" width=\"500\" height=\"281\" src=\"https:\/\/www.youtube.com\/embed\/mzbAVFIs7sE?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe>\n<\/div><\/figure>\n","protected":false},"excerpt":{"rendered":"<p>Final II T\u00e9rmino 2003 \u2013 2004. Febrero 10, 2004 \/ICM00794 Tema 2. Escriba un algoritmo que permita almacenar en una matriz las primeras n filas del tri\u00e1ngulo de pascal&nbsp; (n&lt;20). Muestre por pantalla la matriz de Pascal generada. 1 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 1 1 &nbsp; &nbsp; &nbsp; &nbsp; 1 2 1 &nbsp; &nbsp; [&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":[93],"tags":[148],"class_list":["post-2863","post","type-post","status-publish","format-standard","hentry","category-fp-2eva10","tag-arreglos-matrices"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2863","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=2863"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2863\/revisions"}],"predecessor-version":[{"id":16725,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2863\/revisions\/16725"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2863"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2863"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2863"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}