{"id":1526,"date":"2015-06-04T06:00:56","date_gmt":"2015-06-04T04:00:56","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=1526"},"modified":"2015-06-13T16:17:52","modified_gmt":"2015-06-13T14:17:52","slug":"descomposiciones-en-sumas-de-primos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/descomposiciones-en-sumas-de-primos\/","title":{"rendered":"Descomposiciones en sumas de primos"},"content":{"rendered":"<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   sumaDePrimos :: Int -> [[Int]]\n<\/pre>\n<p>tal que (sumaDePrimos x) es la lista de las listas no crecientes de n\u00fameros primos que suman x. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   sumaDePrimos 10  ==  [[7,3],[5,5],[5,3,2],[3,3,2,2],[2,2,2,2,2]]\n   sumaDePrimos 0   ==  []\n   sumaDePrimos 1   ==  []\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.Numbers.Primes (primes)\n\nsumaDePrimos :: Integer -> [[Integer]]\nsumaDePrimos n = aux n (reverse (takeWhile (<=n) primes))\n    where aux _ [] = []\n          aux n (x:xs) | x > n     = aux n xs\n                       | x == n    = [n] : aux n xs\n                       | otherwise = map (x:) (aux (n-x) (x:xs)) ++ aux n xs\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Definir la funci\u00f3n sumaDePrimos :: Int -> [[Int]] tal que (sumaDePrimos x) es la lista de las listas no crecientes de n\u00fameros primos que suman x. Por ejemplo, sumaDePrimos 10 == [[7,3],[5,5],[5,3,2],[3,3,2,2],[2,2,2,2,2]] sumaDePrimos 0 == [] sumaDePrimos 1 == [] Soluciones import Data.Numbers.Primes (primes) sumaDePrimos :: Integer -> [[Integer]] sumaDePrimos n = aux n (reverse&#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":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1526"}],"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=1526"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1526\/revisions"}],"predecessor-version":[{"id":1555,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1526\/revisions\/1555"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=1526"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=1526"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=1526"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}