{"id":2914,"date":"2014-06-13T13:30:57","date_gmt":"2014-06-13T18:30:57","guid":{"rendered":"http:\/\/blog.espol.edu.ec\/icm00794\/?p=2914"},"modified":"2025-12-11T06:36:20","modified_gmt":"2025-12-11T11:36:20","slug":"2eva2007tii_t4-fibonacci-recursiva","status":"publish","type":"post","link":"https:\/\/blog.espol.edu.ec\/algoritmos101\/fp-2eva10\/2eva2007tii_t4-fibonacci-recursiva\/","title":{"rendered":"2Eva2007TII_T4 Fibonacci recursiva"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\" id=\"2EvaIIT2007\">2da Evaluaci\u00f3n II T\u00e9rmino 2007-2008. Febrero 12, 2008 \/ICM00794<\/h2>\n\n\n\n<p><strong>Tema 4.<\/strong> (20 puntos) Escriba una funci\u00f3n recursiva que permita calcular la el t\u00e9rmino <strong>i<\/strong> de la secuencia de Fibonacci.<\/p>\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\"> fibo(i)= \\begin{cases} 1,&amp; i=1\\\\1,&amp; i=2 \\\\fibo(i-1)+fibo(i-2), &amp; i&gt;2 \\end{cases} <\/span>\n\n\n\n<p>Elabore un programa que usando <strong>fibo<\/strong>(<strong><em>i<\/em><\/strong>) indique cu\u00e1ntos t\u00e9rminos son necesarios para que su acumulado sea mayor que un valor <strong>m<\/strong> dado.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>2da Evaluaci\u00f3n II T\u00e9rmino 2007-2008. Febrero 12, 2008 \/ICM00794 Tema 4. (20 puntos) Escriba una funci\u00f3n recursiva que permita calcular la el t\u00e9rmino i de la secuencia de Fibonacci. Elabore un programa que usando fibo(i) indique cu\u00e1ntos t\u00e9rminos son necesarios para que su acumulado sea mayor que un valor m dado.<\/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-2914","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\/2914","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=2914"}],"version-history":[{"count":4,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2914\/revisions"}],"predecessor-version":[{"id":16773,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/posts\/2914\/revisions\/16773"}],"wp:attachment":[{"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/media?parent=2914"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/categories?post=2914"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.espol.edu.ec\/algoritmos101\/wp-json\/wp\/v2\/tags?post=2914"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}