Editing Lychrel number (section)

== Proof not found ==
In other [[number base|bases]] (these bases are [[powers of 2]], like [[binary number|binary]] and [[hexadecimal]]), certain numbers can be proven to never form a palindrome after repeated reversal and addition,<!-- link is unreachable - "You don't have permission to access" - <ref>http://www.math.niu.edu/~rusin/known-math/96/palindrome {{Dead link|date=February 2022}}</ref> --><ref>{{cite web |last=Brown |first=Kevin |title=Digit Reversal Sums Leading to Palindromes |website=MathPages |url=http://www.mathpages.com/home/kmath004/kmath004.htm }}</ref> but no such proof has been found for 196 and other base 10 numbers.

It is [[conjecture]]d that 196 and other numbers that have not yet yielded a palindrome are Lychrel numbers, but no number in base ten has yet been proven to be Lychrel. Numbers which have not been demonstrated to be non-Lychrel are informally called "candidate Lychrel" numbers. The first few candidate Lychrel numbers {{OEIS|A023108}} are:
:'''196''', 295, 394, 493, 592, 689, 691, 788, 790, '''879''', 887, 978, 986, 1495, 1497, 1585, 1587, 1675, 1677, 1765, 1767, 1855, 1857, 1945, 1947, '''1997'''.

The numbers in bold are suspected Lychrel seed numbers (see below). Computer programs by Jason Doucette, Ian Peters and Benjamin Despres have found other Lychrel candidates. Indeed, Benjamin Despres' program has identified all suspected Lychrel seed numbers of less than 17 digits.<ref>{{cite web |last=VanLandingham |first=Wade |author-link=Wade VanLandingham |title=Lychrel Records |website=p196.org |url=http://www.p196.org/lychrel_records.html |access-date=2011-08-29 |archive-url=https://web.archive.org/web/20160428155517/http://www.p196.org/lychrel_records.html |archive-date=2016-04-28 |url-status=dead }}</ref> Wade Van Landingham's site lists the total number of found suspected Lychrel seed numbers for each digit length.<ref>{{cite web |last=VanLandingham |first=Wade |author-link=Wade VanLandingham |title=Identified Seeds |website=p196.org |url=http://www.p196.org/lychrel_seeds.html |access-date=2011-08-29 |archive-url=https://web.archive.org/web/20160428161428/http://www.p196.org/lychrel_seeds.html |archive-date=2016-04-28 |url-status=dead }}</ref>

The brute-force method originally deployed by John Walker has been refined to take advantage of iteration behaviours. For example, [[Vaughn Suite]] devised a program that only saves the first and last few digits of each iteration, enabling testing of the digit patterns in millions of iterations to be performed without having to save each entire iteration to a file.<ref>{{cite web |title=On Non-Brute Force Methods |url=http://home.cfl.rr.com/p196/math%20solutions.html |archive-url=https://web.archive.org/web/20061015175443/http://home.cfl.rr.com/p196/math%20solutions.html |archive-date=2006-10-15}}</ref> However, so far no algorithm has been developed to circumvent the reversal and addition iterative process.