{"id":2780,"date":"2017-01-05T06:00:24","date_gmt":"2017-01-05T04:00:24","guid":{"rendered":"http:\/\/www.glc.us.es\/~jalonso\/exercitium\/?p=2780"},"modified":"2017-01-12T08:17:31","modified_gmt":"2017-01-12T06:17:31","slug":"sucesion-de-cuadrados-reducidos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/sucesion-de-cuadrados-reducidos\/","title":{"rendered":"Sucesi\u00f3n de cuadrados reducidos"},"content":{"rendered":"<p>La sucesi\u00f3n de cuadrados de orden n definida a partir de un n\u00famero x se forma inici\u00e1ndola en x y, para cada t\u00e9rmino z el siguiente es el n\u00famero formado por los n primeros d\u00edgitos del cuadrado de z. Por ejemplo, para n = 4 y x = 1111, el primer t\u00e9rmino de la sucesi\u00f3n es 1111, el segundo es 1234 (ya que 1111^2 = 1234321) y el tercero es 1522 (ya que 1234^2 = 1522756).<\/p>\n<p>Definir la funci\u00f3n<\/p>\n<pre lang=\"text\">\n   sucCuadrados :: Int -> Integer -> [Integer]\n<\/pre>\n<p>tal que (sucCuadrados n x) es la sucesi\u00f3n de cuadrados de orden n definida a partir de x. Por ejemplo,<\/p>\n<pre lang=\"text\">\n   \u03bb> take 10 (sucCuadrados 4 1111)\n   [1111,1234,1522,2316,5363,2876,8271,6840,4678,2188]\n   \u03bb> take 10 (sucCuadrados 3 457)\n   [457,208,432,186,345,119,141,198,392,153]\n   \u03bb> take 20 (sucCuadrados 2 55)\n   [55,30,90,81,65,42,17,28,78,60,36,12,14,19,36,12,14,19,36,12]\n<\/pre>\n<h4>Soluciones<\/h4>\n<pre lang=\"haskell\">\nsucCuadrados :: Int -> Integer -> [Integer]\nsucCuadrados n x = iterate (siguiente n) x\n\nsiguiente :: Int -> Integer -> Integer\nsiguiente n x = read (take n (show (x^2)))\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>La sucesi\u00f3n de cuadrados de orden n definida a partir de un n\u00famero x se forma inici\u00e1ndola en x y, para cada t\u00e9rmino z el siguiente es el n\u00famero formado por los n primeros d\u00edgitos del cuadrado de z. Por ejemplo, para n = 4 y x = 1111, el primer t\u00e9rmino de la sucesi\u00f3n&#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":[50,11,95,33,47],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2780"}],"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=2780"}],"version-history":[{"count":3,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2780\/revisions"}],"predecessor-version":[{"id":2814,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/posts\/2780\/revisions\/2814"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/media?parent=2780"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/categories?post=2780"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/exercitium\/wp-json\/wp\/v2\/tags?post=2780"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}