{"id":35327,"date":"2016-04-07T00:47:26","date_gmt":"2016-04-07T05:47:26","guid":{"rendered":"http:\/\/andreatrejod.wordpress.com\/?p=219"},"modified":"2016-04-07T02:45:05","modified_gmt":"2016-04-07T07:45:05","slug":"wsq11-3","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/wsq11-3\/","title":{"rendered":"#Wsq11"},"content":{"rendered":"<p>Bueno este wsq fue tan dif\u00edcil de realizar que solo por eso lo voy a poner en espa\u00f1ol jaja, y esto es de lo que se trata:<\/p>\n<p>Your jobs is to create a program that asks the user for two pieces of data:<\/p>\n<ul>\n<li>The lower bound of the sequence<\/li>\n<li>The upper bound of the sequence<\/li>\n<\/ul>\n<div>Then you check the values from the lower bound (inclusive) to the upper bound (inclusive) and make a report of them. During the analysis of each number, if a Lychrel number is found it should be reported immediately with something like \u201cFound a Lychrel number: 196\u201d<\/div>\n<h2>Details<\/h2>\n<div>The report must show:<\/div>\n<div>\n<ul>\n<li>The range of numbers analysed (lower to upper bound)<\/li>\n<li>The number of natural palindromes (no addition to inverse needed)<\/li>\n<li>The number of non-Lycherels encountered (become palindromes)<\/li>\n<li>The number of Lycherel number candidates (that did not converge to palindrome)<\/li>\n<\/ul>\n<p>Since you will not be able to prove that a number is Lycherel (since you cannot computer forever to check), our definition for a Lycherel candidate will be if a number does not converge after 30 iterations of applying the addition to the inverse.<\/p>\n<p>Wow, Ken si que se esforz\u00f3 en complicarnos un poco la vida jaja, primero que nada tenemos que entender que es un n\u00famero Lychrel y este <a href=\"http:\/\/gaussianos.com\/la-conjetura-del-196\/\">link<\/a>\u00a0fue de gran ayuda.<\/p>\n<p>Para entender un poco mejor que era lo que necesit\u00e1bamos hacer realmente en el programa el video de Ken fue de gran ayuda, y lo dejo aqu\u00ed por si alguien no lo ha visto.<\/p>\n<div class=\"jetpack-video-wrapper\"><iframe class='youtube-player' type='text\/html' width='833' height='499' src='https:\/\/www.youtube.com\/embed\/KMDDoipS9H0?version=3&#038;rel=1&#038;%23038;fs=1&#038;%23038;autohide=2&#038;%23038;showsearch=0&#038;%23038;showinfo=1&#038;%23038;iv_load_policy=1&#038;%23038;wmode=transparent' allowfullscreen='true' style='border:0;'><\/iframe><\/div>\n<p>Y despu\u00e9s de varios intentos fallidos, el programa funcion\u00f3 correctamente, o al menos eso creo. Aqu\u00ed est\u00e1n los screenshots :<\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full wp-image-230\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/204e5a9eb3b29cd7894c5a2db54f6b12.jpg\" alt=\"wsq11\"   \/><\/p>\n<p>the second part and the terminal:<\/p>\n<p><img decoding=\"async\" class=\"alignnone size-full wp-image-233\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/9d04cda8d115679edd3a50588332f743.jpg\" alt=\"wsq11.2\"   \/><\/p>\n<p>and the code un\u00a0<a href=\"https:\/\/github.com\/andreatrejod\/TC101\/blob\/master\/lychrel.py\">GitHub<\/a><\/p>\n<\/div>\n<p>  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/andreatrejod.wordpress.com\/219\/\"><img decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/4aeb48b15c6ce090a6a20c393b014c65.jpg\" \/><\/a> <img loading=\"lazy\" decoding=\"async\" alt=\"\" border=\"0\" src=\"http:\/\/kenscourses.com\/tc101winter2016\/wp-content\/uploads\/2016\/04\/ab2e717cae9e0e7ea78fe61dcbbbfac1.jpg#038;blog=97425938&#038;%23038;post=219&#038;%23038;subd=andreatrejod&#038;%23038;ref=&#038;%23038;feed=1\" width=\"1\" height=\"1\" \/><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Bueno este wsq fue tan dif\u00edcil de realizar que solo por eso lo voy a poner en espa\u00f1ol jaja, y esto es de lo que se trata: Your jobs is to create a program that asks the user for two pieces of data: The lower bound of the sequence The upper bound of the sequence &hellip; <a href=\"https:\/\/kenscourses.com\/tc101winter2016\/2016\/04\/wsq11-3\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">#Wsq11<\/span><\/a><\/p>\n","protected":false},"author":73,"featured_media":35329,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[45],"class_list":["post-35327","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-sin-categoria"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35327","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/users\/73"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/comments?post=35327"}],"version-history":[{"count":4,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35327\/revisions"}],"predecessor-version":[{"id":35336,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/posts\/35327\/revisions\/35336"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media\/35329"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/media?parent=35327"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/categories?post=35327"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101winter2016\/wp-json\/wp\/v2\/tags?post=35327"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}