== 
A Lychrel number is a natural number which cannot form a palindrome through the iterative process of repeatedly reversing its base 10 digits and adding the resulting numbers. This process is called the 196algorithm. The name "Lychrel" was coined by Wade VanLandinghamâ€”a rough anagram of his girlfriend's name Cheryl. No Lychrel numbers are known, though many numbers are suspected Lychrels, the smallest being 196.
The reverse and add process produces the sum of a number and the number formed by reversing the order of its digits. e.g. 56 + 65 = 121, 125 + 521 = 646. Some numbers become palindromes quickly after repeated reversal and addition, and are therefore not Lychrel numbers. All 1 digit and 2 digit numbers eventually become palindromes after repeated reversal and addition. About 80% of all numbers under 10,000 resolve into a palindrome in 4 or fewer steps. About 90% solve in 7 steps or less. Here are a few examples of nonLychrel numbers: * 56 becomes palindromic after one iteration: 56+65 = 121. The first known number starting from 0 that does not apparently form a palindrome is a three digit number, 196. It is the smallest Lychrel number candidate. Proof not found In other bases, certain numbers can be proven to never form a palindrome after repeated reversal and addition,[1][2] but no such proof has been found for 196 and other base 10 numbers. It is conjectured that 196 and other numbers which have not yet yielded a palindrome are Lychrel numbers, but no number has yet been proven to be Lychrel. Numbers which have not been demonstrated to be nonLychrel are informally called "candidate Lychrel" numbers. The first few candidate Lychrel numbers (sequence A023108 in OEIS) 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.[3] Wade VanLandingham's site lists the total number of found suspected Lychrel seed numbers for each digit length.[4] The bruteforce 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.[5] But so far no algorithm has been developed to circumvent the reversal and addition iterative process. Threads, seed and kin numbers The term thread, coined by Jason Doucette, refers to the sequence of numbers that may or may not lead to a palindrome through the reverse and add process. Any given seed and its associated kin numbers will converge on the same thread. The thread does not include the original seed or kin number, but only the numbers that are common to both, after they converge. Seed numbers are a subset of Lychrel numbers, that is the smallest number of each non palindrome producing thread. A seed number may be a palindrome itself. The first three examples are shown in bold in the list above. Kin numbers are a subset of Lychrel numbers, that include all numbers of a thread, except the seed, or any number that will converge on a given thread after a single iteration. This term was introduced by Koji Yamashita in 1997. 196 palindrome quest Because 196 (base10) is the lowest candidate Lychrel number it has received the most attention. John Walker began the 196 Palindrome Quest on 12 August 1987 on a Sun 3/260 workstation. He wrote a C program to perform the reversal and addition iterations and to check for a palindrome after each step. The program ran in the background with a low priority and produced a checkpoint to a file every two hours and when the system was shut down, recording the number reached so far and the number of iterations. It restarted itself automatically from the last checkpoint after every shutdown. It ran for almost three years, then terminated (as instructed) on May 24, 1990 with the message: Stop point reached on pass 2,415,836. 196 had grown to a number of one million digits after 2,415,836 iterations without reaching a palindrome. Walker published his findings on the Internet along with the last checkpoint, inviting others to resume the quest using the number reached so far. In 1995, Tim Irvin used a supercomputer and reached the two million digit mark in only three months without finding a palindrome. Jason Doucette then followed suit and reached 12.5 million digits in May 2000. Wade VanLandingham used Jason Doucette's program to reach 13 million digits, a record published in Yes Mag: Canada's Science Magazine for Kids. Since June 2000, Wade VanLandingham has been carrying the flag using programs written by various enthusiasts. By May 1, 2006, VanLandingham had reached the 300 million digit mark (at a rate of one million digits every 5 to 7 days). A palindrome has yet to be found. Other potential Lychrel numbers which have also been subjected to the same brute force method of repeated reversal addition include 879, 1997 and 7059: they have been taken to several million iterations with no palindrome being found.[6] References 1. ^ http://www.math.niu.edu/~rusin/knownmath/96/palindrome
* John Walker  Three years of computing Retrieved from "http://en.wikipedia.org/"

