{"id":2865,"date":"2014-03-03T16:10:20","date_gmt":"2014-03-03T21:10:20","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2865"},"modified":"2026-04-05T07:07:30","modified_gmt":"2026-04-05T12:07:30","slug":"2eva2003tii_t3-funciones-eudoxus-recursivas","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2003tii_t3-funciones-eudoxus-recursivas\/","title":{"rendered":"2Eva2003TII_T3 Funciones eudoxus recursivas"},"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 3. <\/strong>Los n\u00fameros de <strong><em>Eudoxus<\/em> <\/strong>se definen mediante la siguiente formulaci\u00f3n:<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code>{x&#091;0] = 1\n{x&#091;i] = y&#091;i] + y&#091;i-1] , i&gt;=1\n\n{y&#091;0] = 0\n{y&#091;i] = x&#091;i-1] + y&#091;i-1] , i&gt;=1<\/code><\/pre>\n\n\n\n<p>a) Escriba las <i>funciones<\/i> recursivas <strong>eudoxusX(i)<\/strong> y <strong>eudoxusY(i)<\/strong> que permitan generar cada par ordenado(<strong>x<sub>i<\/sub><\/strong>, <strong>y<sub>i<\/sub><\/strong>).<\/p>\n\n\n\n<p>b) Adicionalmente escriba un <i>programa<\/i> de prueba que, utilizando las funciones anteriores, muestre los pares ordenados generados recursivamente para 0\u2264<strong>i<\/strong>\u2264<strong>n<\/strong>, donde <strong>n<\/strong> es un valor entero le\u00eddo previamente.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Final II T\u00e9rmino 2003 \u2013 2004. Febrero 10, 2004 \/ICM00794 Tema 3. Los n\u00fameros de Eudoxus se definen mediante la siguiente formulaci\u00f3n: a) Escriba las funciones recursivas eudoxusX(i) y eudoxusY(i) que permitan generar cada par ordenado(xi, yi). b) Adicionalmente escriba un programa de prueba que, utilizando las funciones anteriores, muestre los pares ordenados generados recursivamente [&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":[156],"class_list":["post-2865","post","type-post","status-publish","format-standard","hentry","category-fp-2eva10","tag-funciones-recursivas"],"_links":{"self":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2865","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=2865"}],"version-history":[{"count":3,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2865\/revisions"}],"predecessor-version":[{"id":16726,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2865\/revisions\/16726"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2865"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2865"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2865"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}