{"id":1293,"date":"2014-03-03T11:05:13","date_gmt":"2014-03-03T16:05:13","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=1293"},"modified":"2026-04-05T17:54:24","modified_gmt":"2026-04-05T22:54:24","slug":"s2eva2003tii_t2-mostrar-un-triangulo-de-pascal","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-s2eva10\/s2eva2003tii_t2-mostrar-un-triangulo-de-pascal\/","title":{"rendered":"s2Eva2003TII_T2 Mostrar un tri\u00e1ngulo de Pascal"},"content":{"rendered":"\n

Ejercicio<\/strong><\/em>: 2Eva2003TII_T2 Mostrar un tri\u00e1ngulo de Pascal<\/a><\/p>\n\n\n\n

Para crear la matriz de Pascal en Python se usa la librer\u00eda Numpy, con lo que se crea un arreglo de tama\u00f1o nxn lleno de ceros.<\/p>\n\n\n\n

1<\/td> <\/td> <\/td> <\/td> <\/td> <\/td><\/tr>
1<\/td>1<\/td> <\/td> <\/td> <\/td> <\/td><\/tr>
1<\/td>2<\/td>1<\/td> <\/td> <\/td> <\/td><\/tr>
1<\/td>3<\/strong><\/em><\/td>3<\/strong><\/em><\/td>1<\/td> <\/td> <\/td><\/tr>
1<\/td>4<\/td>6<\/strong><\/em><\/td>4<\/td>1<\/td> <\/td><\/tr>
1<\/td>5<\/td>10<\/td>10<\/td>5<\/td>1<\/td><\/tr>
\u2026.<\/td>\u2026.<\/td>\u2026.<\/td>\u2026.<\/td>\u2026.<\/td>\u2026.<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

Al recorrer la matriz por cada fila f<\/code> y columna c<\/code>, si la posici\u00f3n matriz[f,c] es la primera columna a la izquierda (c==0) o la diagonal (f==c) se escribe 1.<\/p>\n\n\n\n

Si la posici\u00f3n de la matriz[f,c] es debajo de la diagonal, se suman los valores de las casilla inmediata superior e izquierda superior.<\/p>\n\n\n\n

pascal[f,c] = pascal[f-1,c] + pascal[f-1,c-1]<\/code><\/pre>\n\n\n\n
Al terminar el recorrido se tendr\u00e1 la matriz con el tri\u00e1ngulo de Pascal.<\/p>\n\n\n\n
Tarea<\/strong>: Convertir el algoritmo a funci\u00f3n.<\/p>\n\n\n\n
Algoritmo en Python<\/h2>\n\n\n
\n# ICM00794-Fundamentos de Computaci\u00f3n - FCNM-ESPOL\n# 2Eva_IIT2003_T2 Mostrar un tri\u00e1ngulo de Pascal\n# propuesta: edelros@espol.edu.ec\n\nimport numpy as np\n\n# INGRESO\nn = int(input('tama\u00f1o del triangulo: '))\n\n# PROCEDIMIENTO\npascal = np.zeros(shape=(n,n),dtype=int)\nf = 0\nwhile (f<n):\n    c = 0\n    while (c<=f):\n        if (c==0 or c==f):\n            pascal[f,c] = 1\n        else:\n            pascal[f,c] = pascal[f-1,c] + pascal[f-1,c-1]\n        c = c+1\n    f = f+1\n\nprint(pascal)\n<\/pre><\/div>\n\n\n
resultado del algoritmo en una matriz<\/p>\n\n\n\n
tama\u00f1o del triangulo: 10\n[[  1   0   0   0   0   0   0   0   0   0]\n [  1   1   0   0   0   0   0   0   0   0]\n [  1   2   1   0   0   0   0   0   0   0]\n [  1   3   3   1   0   0   0   0   0   0]\n [  1   4   6   4   1   0   0   0   0   0]\n [  1   5  10  10   5   1   0   0   0   0]\n [  1   6  15  20  15   6   1   0   0   0]\n [  1   7  21  35  35  21   7   1   0   0]\n [  1   8  28  56  70  56  28   8   1   0]\n [  1   9  36  84 126 126  84  36   9   1]]\n>>><\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
Ejercicio: 2Eva2003TII_T2 Mostrar un tri\u00e1ngulo de Pascal Para crear la matriz de Pascal en Python se usa la librer\u00eda Numpy, con lo que se crea un arreglo de tama\u00f1o nxn lleno de ceros. 1           1 1         1 2 1       1 3 3 1 […]<\/p>\n","protected":false},"author":8043,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"wp-custom-template-entrada-fp-ejemplos","format":"standard","meta":{"footnotes":""},"categories":[131],"tags":[58,157],"class_list":["post-1293","post","type-post","status-publish","format-standard","hentry","category-fp-s2eva10","tag-ejemplos-python","tag-fundamentos-programacion"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/1293","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=1293"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/1293\/revisions"}],"predecessor-version":[{"id":23664,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/1293\/revisions\/23664"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=1293"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=1293"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=1293"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}