{"id":38016,"date":"2016-10-14T23:23:16","date_gmt":"2016-10-15T04:23:16","guid":{"rendered":"http:\/\/danigguemez.wordpress.com\/?p=477"},"modified":"2016-10-14T23:23:16","modified_gmt":"2016-10-15T04:23:16","slug":"yo-soy-196","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101fall2016\/syndicated\/yo-soy-196\/","title":{"rendered":"Yo soy 196"},"content":{"rendered":"

--Originally published at Fundamentos de Programaci\u00f3n<\/a><\/a><\/em>
<\/p>\n

Long time ago I tweeted that I was going to do all the proyects from a previous Ken’s course but it’s been a long time and I haven’t \u00a0posted a single solution.<\/p>\n

\"0mabexr_700wa_0\"+<\/p>\n

It’s not that I haven’t done them, is just that I didn’t know which one to post, so I chose the lychrell number challenge because I thought it was really interesting, I didn\u00b4t even knew that kind of numbers had a name!<\/p>\n

So here is what the challenge said:<\/p>\n

WSQ11 \u2013 Yo Soy 196<\/h1>\n
\n

<\/h2>\n

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<\/a><\/p>\n

What to Do<\/h2>\n

Your jobs is to create a program that asks the user for two pieces of data:<\/p>\n

    \n
  • The lower bound of the sequence<\/li>\n
  • The upper bound of the sequence<\/li>\n<\/ul>\n
    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

    Details<\/h2>\n
    The report must show:<\/div>\n
    \n
      \n
    • The range of numbers analysed (lower to upper bound)<\/li>\n
    • The number of natural palindromes (no addition to inverse needed)<\/li>\n
    • The number of non-Lycherels encountered (become palindromes)<\/li>\n
    • The number of Lycherel number candidates (that did not converge to palindrome)<\/li>\n<\/ul>\n<\/div>\n

      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

      Here is my solution:<\/p>\n

      \"yosoy1\"<\/p>\n

      \"yosoy2\"<\/p>\n

      We begin validating the user’s input as always with try and except inside a loop.<\/p>\n

      We create a function that reverses

      \"yosoy3\"<\/div>\n
      \"\"<\/div>\n
      \"\"<\/div> number in order for us to compare it to the original number.<\/p>\n

      The for willdo one of three:<\/p>\n

      Indicate that it is a natural palindrome if without any cycle repetition it is a palindrome.<\/p>\n

      If the number after 30 or less loops becomes a palindrome, and<\/p>\n

      If the number, after 30+ loops is still not a palindrome.<\/p>\n

      The output is the amount of natural palindromes, the number of non-lychrell numbers and print the lichrel numbers, like this:<\/p>\n

      \"yosoy3\"<\/p>\n

      It was pretty fun to make. If you have trouble understanding what the program is supposed to do (like me) check out Ken’s video:<\/p>\n