{"id":2535,"date":"2016-11-04T06:00:17","date_gmt":"2016-11-04T04:00:17","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=2535"},"modified":"2016-11-11T07:45:42","modified_gmt":"2016-11-11T05:45:42","slug":"primos-de-kamenetsky","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/primos-de-kamenetsky\/","title":{"rendered":"Primos de Kamenetsky"},"content":{"rendered":"<p>Un n\u00famero primo se dice que es un <strong>primo de Kamenetsky<\/strong> si al anteponerlo cualquier d\u00edgito se obtiene un n\u00famero compuesto. Por ejemplo, el 5 es un primo de Kamenetsky ya que 15, 25, 35, 45, 55, 65, 75, 85 y 95 son compuestos. Tambi\u00e9n lo es 149 ya que 1149, 2149, 3149, 4149, 5149, 6149, 7149, 8149 y 9149 son compuestos.<\/p>\n<p>Definir la sucesi\u00f3n<\/p>\n<pre lang=\"text\">\n   primosKamenetsky :: [Integer]\n<\/pre>\n<p>tal que sus elementos son los n\u00fameros primos de Kamenetsky. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   take 5 primosKamenetsky  ==  [2,5,149,401,509]\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nimport Data.Numbers.Primes (isPrime, primes)\n\nprimosKamenetsky :: [Integer]\nprimosKamenetsky =\n  [x | x <- primes\n     , esKamenetsky x] \n\nesKamenetsky :: Integer -> Bool\nesKamenetsky x =\n  all (not . isPrime) [read (d:xs) | d <- \"123456789\"]\n  where xs = show x\n<\/pre>\n<h4>Referencias<\/h4>\n<ul>\n<li><a href=\"http:\/\/bit.ly\/2eScU24\">Sucesi\u00f3n A155762<\/a> de la OEIS.<\/li>\n<li><a href=\"http:\/\/bit.ly\/2eSkgmd\">Anteponer un d\u00edgito a un primo<\/a> en \"N\u00fameros y algo m\u00e1s\".<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Un n\u00famero primo se dice que es un primo de Kamenetsky si al anteponerlo cualquier d\u00edgito se obtiene un n\u00famero compuesto. Por ejemplo, el 5 es un primo de Kamenetsky ya que 15, 25, 35, 45, 55, 65, 75, 85 y 95 son compuestos. Tambi\u00e9n lo es 149 ya que 1149, 2149, 3149, 4149, 5149,&#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":[41,8,174,181,11,173,95,33],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2535"}],"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=2535"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2535\/revisions"}],"predecessor-version":[{"id":2566,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2535\/revisions\/2566"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=2535"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=2535"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=2535"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}