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

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

    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

    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 link<\/a>\u00a0fue de gran ayuda.<\/p>\n

    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