{"id":2769,"date":"2017-01-02T06:00:36","date_gmt":"2017-01-02T04:00:36","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=2769"},"modified":"2017-01-09T08:35:16","modified_gmt":"2017-01-09T06:35:16","slug":"terminaciones-de-fibonacci","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/terminaciones-de-fibonacci\/","title":{"rendered":"Terminaciones de Fibonacci"},"content":{"rendered":"<p>Definir la sucesi\u00f3n<\/p>\n<pre lang=\"text\">\n   sucFinalesFib :: [(Integer,Integer)]\n<\/pre>\n<p>cuyos elementos son los pares (n,x), donde x es el n-\u00e9simo t\u00e9rmino de la sucesi\u00f3n de Fibonacci, tales que la terminaci\u00f3n de x es n. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> take 6 sucFinalesFib\n   [(0,0),(1,1),(5,5),(25,75025),(29,514229),(41,165580141)]\n   \u03bb> head [(n,x) | (n,x) <- sucFinalesFib, n > 200]\n   (245,712011255569818855923257924200496343807632829750245)\n   \u03bb> head [n | (n,_) <- sucFinalesFib, n > 10^4]\n   10945\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.List (genericIndex, isSuffixOf)\n\nsucFinalesFib :: [(Integer, Integer)]\nsucFinalesFib =\n  [(n, fib n) | n <- [0..]\n              , show n `isSuffixOf` show (fib n)]\n\nsucFib :: [Integer]\nsucFib = 0 : 1 : zipWith (+) sucFib (tail sucFib)\n\n-- (fib n) es el n-\u00e9simo t\u00e9rmino de la sucesi\u00f3n de Fibonacci.\nfib :: Integer -> Integer\nfib n = sucFib `genericIndex` n\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la sucesi\u00f3n sucFinalesFib :: [(Integer,Integer)] cuyos elementos son los pares (n,x), donde x es el n-\u00e9simo t\u00e9rmino de la sucesi\u00f3n de Fibonacci, tales que la terminaci\u00f3n de x es n. Por ejemplo, \u03bb> take 6 sucFinalesFib [(0,0),(1,1),(5,5),(25,75025),(29,514229),(41,165580141)] \u03bb> head [(n,x) | (n,x) 200] (245,712011255569818855923257924200496343807632829750245) \u03bb> head [n | (n,_) 10^4] 10945 Soluciones import Data.List&#8230;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[4],"tags":[8,286,256,171,11,33,45],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2769"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/comments?post=2769"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2769\/revisions"}],"predecessor-version":[{"id":2807,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2769\/revisions\/2807"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=2769"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=2769"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=2769"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}