\n \u03bb> [sylvester n | n <- [0..7]]\n [2,3,7,43,1807,3263443,10650056950807,113423713055421844361000443]\n \u03bb> length (show (sylvester 25))\n 6830085\n<\/pre>\n- \n
- (graficaSylvester d n) dibuja la gr\u00e1fica de los d \u00faltimos d\u00edgitos de los n primeros t\u00e9rminos de la sucesi\u00f3n de Sylvester. Por ejemplo,\n
- \n
- (graficaSylvester 3 30) dibuja
\n![\"La_sucesion_de_Sylvester_(3,30)\"](\"https:\/\/i0.wp.com\/www.glc.us.es\/~jalonso\/exercitium\/wp-content\/uploads\/2018\/03\/La_sucesion_de_Sylvester_330.png?resize=640%2C480\")
<\/a><\/li>\n- (graficaSylvester 4 30) dibuja
\n![\"La_sucesion_de_Sylvester_(4,30)\"](\"https:\/\/i0.wp.com\/www.glc.us.es\/~jalonso\/exercitium\/wp-content\/uploads\/2018\/03\/La_sucesion_de_Sylvester_430.png?resize=640%2C480\")
<\/a><\/li>\n- (graficaSylvester 5 30) dibuja
\n![\"La_sucesion_de_Sylvester_(5,30)\"](\"https:\/\/i0.wp.com\/www.glc.us.es\/~jalonso\/exercitium\/wp-content\/uploads\/2018\/03\/La_sucesion_de_Sylvester_530.png?resize=640%2C480\")
<\/a><\/li>\n<\/ul>\n<\/li>\n<\/ul>\nSoluciones<\/h4>\n
\nimport Data.List (genericIndex)\nimport Data.Array ((!), array)\nimport Graphics.Gnuplot.Simple (plotList, Attribute (Key, PNG))\n\n-- 1\u00aa soluci\u00f3n (por recursi\u00f3n)\n-- ===========================\n\nsylvester1 :: Integer -> Integer\nsylvester1 0 = 2\nsylvester1 n = 1 + product [sylvester1 k | k <- [0..n-1]]\n\n-- 2\u00aa soluci\u00f3n (con programaci\u00f3n din\u00e1mica)\n-- =======================================\n\nsylvester2 :: Integer -> Integer\nsylvester2 n = v ! n where\n v = array (0,n) [(i,f i) | i <- [0..n]]\n f 0 = 2\n f m = 1 + product [v!k | k <- [0..m-1]]\n\n-- 3\u00aa soluci\u00f3n\n-- ===========\n\nsylvester3 :: Integer -> Integer\nsylvester3 0 = 2\nsylvester3 n = 1 + x^2 - x\n where x = sylvester3 (n-1)\n\n-- 4\u00aa soluci\u00f3n\n-- ===========\n\nsylvester4 :: Integer -> Integer\nsylvester4 n = v ! n where\n v = array (0,n) [(i,f i) | i <- [0..n]]\n f 0 = 2\n f m = 1 + x^2 - x\n where x = v ! (m-1)\n\n-- 4\u00aa soluci\u00f3n\n-- ===========\n\nsylvester5 :: Integer -> Integer\nsylvester5 0 = 2\nsylvester5 n = 1 + (productosSylvester `genericIndex` (n-1))\n\nsucSylvester5 :: [Integer]\nsucSylvester5 = map sylvester5 [0..]\n\nproductosSylvester :: [Integer]\nproductosSylvester = scanl1 (*) sucSylvester5\n\n-- Comparaci\u00f3n de eficiencia\n-- =========================\n\n-- \u03bb> length (show (sylvester1 20))\n-- 213441\n-- (3.40 secs, 519,249,840 bytes)\n-- \u03bb> length (show (sylvester2 20))\n-- 213441\n-- (0.10 secs, 13,716,024 bytes)\n-- \u03bb> length (show (sylvester3 20))\n-- 213441\n-- (0.16 secs, 13,646,472 bytes)\n-- \u03bb> length (show (sylvester4 20))\n-- 213441\n-- (0.18 secs, 13,654,064 bytes)\n-- \u03bb> length (show (sylvester5 20))\n-- 213441\n-- (0.12 secs, 13,497,192 bytes)\n\ngraficaSylvester :: Integer -> Integer -> IO ()\ngraficaSylvester d n =\n plotList [ Key Nothing\n , PNG (\"La_sucesion_de_Sylvester_\" ++ show (d,n) ++ \".png\")\n ]\n [sylvester5 k `mod` (10^d) | k <- [0..n]]\n<\/pre>\n","protected":false},"excerpt":{"rendered":"La sucesi\u00f3n de Sylvester es la sucesi\u00f3n que comienza en 2 y sus restantes t\u00e9rminos se obtienen multiplicando los anteriores y sum\u00e1ndole 1. Definir las funciones sylvester :: Integer -> Integer graficaSylvester :: Integer -> Integer -> IO () tales que (sylvester n) es el n-\u00e9simo t\u00e9rmino de la sucesi\u00f3n de Sylvester. Por ejemplo, \u03bb>…<\/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":[250,8,286,256,376,10,42,89,11,309,157,6,252,33],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3876"}],"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=3876"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3876\/revisions"}],"predecessor-version":[{"id":3908,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/3876\/revisions\/3908"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=3876"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=3876"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=3876"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
- (graficaSylvester 4 30) dibuja
- (graficaSylvester 3 30) dibuja
![\"La_sucesion_de_Sylvester_(3,30)\"](\"https:\/\/i0.wp.com\/www.glc.us.es\/~jalonso\/exercitium\/wp-content\/uploads\/2018\/03\/La_sucesion_de_Sylvester_330.png\")
<\/a><\/li>\n