{"id":1424,"date":"2015-05-07T06:00:31","date_gmt":"2015-05-07T04:00:31","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=1424"},"modified":"2015-05-15T19:16:30","modified_gmt":"2015-05-15T17:16:30","slug":"multiplos-especiales","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/multiplos-especiales\/","title":{"rendered":"M\u00faltiplos especiales"},"content":{"rendered":"<p>Dado dos n\u00fameros n y m, decimos que m es un m\u00faltiplo especial de n si m es un m\u00faltiplo de n y m no tiene ning\u00fan factor primo que sea congruente con 1 m\u00f3dulo 3.<\/p>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   multiplosEspecialesCota :: Int -> Int -> [Int]\n<\/pre>\n<p>tal que (multiplosEspecialesCota n k) es la lista ordenada de todos los m\u00faltiplos especiales de n que son menores o iguales que k. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   multiplosEspecialesCota 5 50  ==  [5,10,15,20,25,30,40,45,50]\n   multiplosEspecialesCota 7 50  ==  []\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.Numbers.Primes (primeFactors)\n\nmultiplosEspecialesCota :: Int -> Int -> [Int]\nmultiplosEspecialesCota n k =\n    [m | m <- [n,2*n..k], \n         all (\\p -> p `mod` 3 \/= 1) (primeFactors m)]\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>Dado dos n\u00fameros n y m, decimos que m es un m\u00faltiplo especial de n si m es un m\u00faltiplo de n y m no tiene ning\u00fan factor primo que sea congruente con 1 m\u00f3dulo 3. Definir la funci\u00f3n multiplosEspecialesCota :: Int -> Int -> [Int] tal que (multiplosEspecialesCota n k) es la lista ordenada&#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":[5],"tags":[41,8,89,11,247],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1424"}],"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=1424"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1424\/revisions"}],"predecessor-version":[{"id":1462,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/1424\/revisions\/1462"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=1424"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=1424"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=1424"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}