{"id":1473,"date":"2016-02-03T08:49:15","date_gmt":"2016-02-03T14:49:15","guid":{"rendered":"http:\/\/kenscourses.com\/tc201winter2016\/?p=1473"},"modified":"2016-02-03T08:49:15","modified_gmt":"2016-02-03T14:49:15","slug":"wsq08-yo-soy-196","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc201winter2016\/2016\/02\/wsq08-yo-soy-196\/","title":{"rendered":"WSQ08 \u2013 Yo Soy 196"},"content":{"rendered":"<h2>Background<\/h2>\n<figure id=\"attachment_7785\" aria-describedby=\"caption-attachment-7785\" style=\"width: 300px\" class=\"wp-caption aligncenter\"><a href=\"http:\/\/kenscourses.com\/tc101fall2015\/wp-content\/uploads\/2015\/03\/5490820_02407baadc_o.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"size-medium wp-image-7785\" src=\"http:\/\/kenscourses.com\/tc101fall2015\/wp-content\/uploads\/2015\/03\/5490820_02407baadc_o-300x200.jpg\" alt=\"creative commons licensed (BY-NC-ND) flickr photo by K &amp; P: http:\/\/flickr.com\/photos\/kenandpauline\/5490820\" width=\"300\" height=\"200\" \/><\/a><figcaption id=\"caption-attachment-7785\" class=\"wp-caption-text\">creative commons licensed (BY-NC-ND) flickr photo by K &amp; P: http:\/\/flickr.com\/photos\/kenandpauline\/5490820<\/figcaption><\/figure>\n<p>Lychrel numbers are natural numbers that do not form a palindrome after successive additions to their inverse. See details on Wikipedia: <a title=\"Wikipedia entry for Lychrel Number\" href=\"http:\/\/en.wikipedia.org\/wiki\/Lychrel_number\">http:\/\/en.wikipedia.org\/wiki\/Lychrel_number<\/a><\/p>\n<h2>What to Do<\/h2>\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 &#8220;Found a Lychrel number: 196&#8221;<\/div>\n<div><\/div>\n<div>Again, think OBJECT-oriented programming in Java!<\/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<\/div>\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<h2>What to Submit<\/h2>\n<p>As usual, create a blog post explaining what you did, where you found resources (books, videos, web pages, friends) to help you solve this. Remember to put the tag #WSQ08 on your post so our blog hub picks that up.<\/p>\n<p>You should include your code as a link to GitHub. You really should start using your GitHub repository now. If you need help on that, just ask Ken or your classmates.<\/p>\n<p>And of course, leave any questions here as well as asking those questions on Twitter with the hashtag #TC201 so we all see your question posted there.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Background Lychrel numbers are natural numbers that do not form a palindrome after successive additions to their inverse. See details on Wikipedia: http:\/\/en.wikipedia.org\/wiki\/Lychrel_number What to Do 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 Then &hellip; <a href=\"https:\/\/kenscourses.com\/tc201winter2016\/2016\/02\/wsq08-yo-soy-196\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">WSQ08 \u2013 Yo Soy 196<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":7785,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[18,60],"tags":[],"class_list":["post-1473","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-instructor","category-wsqs"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1473","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/comments?post=1473"}],"version-history":[{"count":1,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1473\/revisions"}],"predecessor-version":[{"id":1474,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/posts\/1473\/revisions\/1474"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/media\/7785"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/media?parent=1473"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/categories?post=1473"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc201winter2016\/wp-json\/wp\/v2\/tags?post=1473"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}