{"id":2548,"date":"2014-09-07T20:30:54","date_gmt":"2014-09-08T01:30:54","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2548"},"modified":"2025-12-11T20:16:27","modified_gmt":"2025-12-12T01:16:27","slug":"3eva2006tii_t2-generar-triangulo-de-pascal","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-3eva10\/3eva2006tii_t2-generar-triangulo-de-pascal\/","title":{"rendered":"3Eva2006TII_T2 Generar tri\u00e1ngulo de Pascal"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"3EvaIIT2006\">3ra Evaluaci\u00f3n II T\u00e9rmino 2006-2007, Febrero 6, 2007 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 2.<\/strong> (20 Puntos)&nbsp;El tri\u00e1ngulo de Pascal, es un tri\u00e1ngulo de n\u00fameros enteros, infinito y sim\u00e9trico.<\/p>\n\n\n\n<figure class=\"wp-block-image aligncenter\"><img loading=\"lazy\" decoding=\"async\" width=\"380\" height=\"153\" src=\"http:\/\/blog.espol.edu.ec\/algoritmos101\/files\/2015\/03\/triagPascal.gif\" alt=\"tri\u00e1ngulo de Pascal\" class=\"wp-image-304\" \/><\/figure>\n\n\n\n<p>Se genera de arriba hacia abajo con la propiedad de que sus extremos siempre son 1, y que sus n\u00fameros interiores son la suma de los dos inmediatos superiores.<\/p>\n\n\n\n<p>Escriba un programa en matlab que genere un tri\u00e1ngulo de Pascal para <strong>n<\/strong> filas, y muestre la suma de sus n\u00fameros pares.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-alpha-channel-opacity\" \/>\n\n\n\n<p><em><strong>Sugerencia<\/strong><\/em>: 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\n\n\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>3ra Evaluaci\u00f3n II T\u00e9rmino 2006-2007, Febrero 6, 2007 \/ICM00794 Tema 2. (20 Puntos)&nbsp;El tri\u00e1ngulo de Pascal, es un tri\u00e1ngulo de n\u00fameros enteros, infinito y sim\u00e9trico. Se genera de arriba hacia abajo con la propiedad de que sus extremos siempre son 1, y que sus n\u00fameros interiores son la suma de los dos inmediatos superiores. Escriba [&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":[120],"tags":[148],"class_list":["post-2548","post","type-post","status-publish","format-standard","hentry","category-fp-3eva10","tag-arreglos-matrices"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2548","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=2548"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2548\/revisions"}],"predecessor-version":[{"id":17150,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2548\/revisions\/17150"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2548"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2548"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2548"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}