The Deny Proof of the Palindrome Number Conjecture

Palindrome number conjecture: Take any non-palindromic natural number with two or more digits, add its inverse ordinal number, continue to use the inverted number of sum plus sum, repeat this process continuously. After a finite number of operations, a palindrome number must be obtained. We firstly give out several definitions: The pure-single-digit-of-sum is the number of single digits that only count the sum of two numbers of the same digit in the vertical operation of addition, which is referred to as pure single digit for short, denoted by g. The pure-carry-digit-of-sum is the carry digit that only counts the sum of two numbers in the same bit in the vertical operation of addition. It is a special number composed of only 1 and 0, which is represented by j'. The complement-0-carry-digit-of-sum is to supplement a 0 on the last side of j' according to the rule of adding bits, which is denoted by j. Therefore, in the addition operation, the sum of any natural number and its inverse ordinal number is divided into two parts: g and j. Then, the characteristics of g and j are characterized by the following two theorems: Theorem 1: As all the numbers in j are 0, j is the palindrome number; As the numbers in j are not all 0, j is not a palindrome number. Theorem 2: The sum of any palindrome number H and any non-palindrome j number must be a non-palindrome number. Then we proved the palindrome number conjecture is not correct by using the above two theorems.

Reverse-order-number is the number opposite to the number (code) of a natural number. For example, the reverse-order-number of 12 is 21, the reverseorder-number of 123 is 321, the reverse-order-number of 150 is 051, the reverse-order-number of 1500 is 0051, the reverse-order-number of 3658 is 8563.
If a natural number is recorded as p and its inverse number is recorded as q, then the inverse number of q is p, then p and q are reciprocal numbers. We call p and q a pair of inverse numbers. From the definition, a digit number is equal to the digit number of its inverse number.
Palindrome number conjecture: Take any non-palindromic natural number with two or more digits, add its inverse ordinal number, continue to use the inverted number of sum plus sum, repeat this process continuously. After a finite number of operations, a palindrome number must be obtained.
For example, if 7299 is taken, the inverse number is 9927, and the two numbers are added: 7299 + 9927 = 17,226; and then add its reverse order number: 17,226 + 62,271 = 79,497, 79,497 is a palindrome number.
Most natural numbers become palindromes through this calculation. "At present, the proven conclusions are: 1) All single and two digits can converge to one palindrome number after finite step iteration; 2) 80% of the numbers less than 10,000 can converge to palindromes within 4 steps; 3) 90% of the numbers can converge to palindromes within 7 steps [1]. Has been calculated, 97.5% of the numbers less than 10,000 can converge to palindromes within 24 steps. "Palindrome number conjecture is a famous mathematical problem, especially 196. It has not been proved whether it is Lychrel number (Note: those numbers that do not meet the palindrome number conjecture are called Lychrel numbers) [1]." "196 has been calculated 100,000 times and the number has been 'upgraded' to 21,000 bits. Among the first 100,000 integers, there are 5996 numbers like 196, and 196 is the smallest one [2]." "It is reported that someone has added 50,000 steps in reverse order to 196, and there is still no palindrome number. This mathematical conjecture has not been proved [3]." In 1938, before the advent of the electronic computer, the American mathematician D. Lehmer (1905-1991) calculated step 73 and obtained a 35 bit sum without forming a "palindrome number". So far, the mathematics lovers who challenge this problem have never stopped. With the development of computer The opposite side of the palindrome number conjecture is called "Lychrel numbers conjecture", that is, there is always a positive integer. According to the operating rules of the palindrome number conjecture, no matter how many times you add it, you still can't get a palindrome number. The palindrome number conjecture is proved, which also proves that the "Lychrel numbers conjecture" is correct.

Main Results
The whole process includes three parts. Part 1 includes the content of palindrome number conjecture and seven definitions. Part 2 are theorem 1 and theorem 2 and their proofs. Part 3 is the summary proof. Using theorem 1 and theorem 2, it is proved that the palindrome number conjecture is not correct, and some counter examples are given.

Part 1
Palindrome number conjecture: Take any natural number with two or more numbers, which natural number is not a palindrome, add its inverse number, if you can't get the palindrome number, continue to use the inverted number of sum plus sum, repeat this process continuously. After a finite number of operations, a palindrome number must be obtained.
We firstly give several definitions: Let a natural number be 1 2 , and denoted it with p, that is, , then the inverse number of p is  , so p and q are reciprocal numbers. We call p and q a pair of inverse numbers. It can be seen that the digits of p and q are equal. We denote the digits of p and q digits with p w and q w respectively, then p q w w = .
In order to study the special needs of the problem, this paper temporarily stipulates that 0 in any position cannot be omitted. For example, the inverse number of 1500 must be written as 0051, and it cannot be written as 51 after 0.
) in the addend p and the addend q.
, that's ten digits, and Definition 2: Addition of p and q is expressed as p q ⊕ , which is to perform the following operations: ⊕ , which is successively arranged by the single digit 1 k i g − + of the sum of two homologous numbers We abbreviate the pure-single-digit-of-sum as pure-single-digits, expressed by g, then Since the addend i r and the addend We abbreviate the pure-carry-digit-of-sum as the pure-carry-digit, which is denoted by j', then are one-to-one correspondence, g is a palindrome number, so any j' is a palindrome number.
Definition 5: Complement-0-carry-digit-of-sum is to add a 0 to the last side of the pure carry j' according to the rule of bit alignment during addition operation. The 0 after j' and j' are collectively referred to as the complement 0 carry of sum.
We abbreviate the complement-0-digit-of-sum as the complement-0-digit, which is denoted by j, that is, 0 j j′ = , then 1 1 Special emphasis: the last digit of j is always 0, any other 0 in j is meaningful and cannot be omitted.
  In the above formula, the rule of adding two numbers in the same position is the same as our usual addition.
Definition 7: Horizontal type operation of p q ⊕ as: We denote the digit of g with g w , according to We denote the digit of j' with j w ′ , according to We denote the digit of j with j w ′ , then Finally, p j q g ⊕ =+ , the vertical formula of addition is: In the above formula, the rule of adding two numbers in the same position is the same as our usual addition. where 828 is the pure single digit g of sum and 0100 is the pure carry digit j of sum; where, p = 365, q = 563, g = 828, j' = 010, j = 0100. Next, we use theorem 1 and theorem 2 to characterize the properties of g and j.
Part 2 Theorem 1: As all the numbers in j are 0, j is a palindrome number; as the numbers in j are not all 0, j is a non-palindrome number.
Proof: As all the numbers in j are 0, whether there are 2m − 1 ( m Z + ∈ ) zeros or 2m ( m Z + ∈ ) zeros, always corresponds to 0, which has symmetry, so j is a palindrome number.
As the numbers in j are not all 0, we use the method of counter evidence to prove it.
Suppose that when the numbers in j are not all 0, j is the palindrome number. It is proved in two cases according to the parity of j' digits. When the numbers in j are not all 0, it is equivalent that the numbers in j' are not all 0. Since j' is a symmetric number, it is advisable to set the symmetry center of j abc hikMkih cba ′ =   , The center of symmetry of j' is M. Then 0 j abc hikMkih cba =   , the center of symmetry of j is the middle of M and k on the right side of M.
By the assumption that j is a palindrome number, we get M = k, k = i, i = h, …, c = b, b = a, a = 0.
So all the numbers in j are 0, that is, This contradicts the hypothesis "the numbers in j are not all 0". Therefore, the proposition "As the numbers in j are not all 0, j is not a palindrome number" is correct.
When the numbers in j are not all 0, it is equivalent that the numbers in j' are not all 0. Since j' is a symmetric number, it is advisable to set the symmetry center of j abc hikMMkih cba ′ =   , and the symmetry center of j' as the middle position between the two M. Then 0 j abc hikMMkih cba =   , and the center of symmetry of j is M on the right. By assumption that j is a palindrome number, we get M = k, i = h, …, c = b, b = a, a = 0.
So all the numbers in j are 0, that is, This contradicts the hypothesis "the numbers in j are not all 0". Therefore, the proposition "As the numbers in j are not all 0, j is not a palindrome number" is correct.
Therefore, as the numbers in j are not all 0, j is not a palindrome number.
Thus theorem 1 is correct. Corollary 1: The center (middle most position) of any natural number is the symmetry point. As long as the sum of two numbers at the left and right symmetry positions is greater than or equal to 10 (as the number of digits of natural number is odd, the middle number is greater than or equal to 5), the sum obtained by adding the number and its inverted number must not be palindromes.
In other words, as a number is summed with its inverse number, once the carry is 1, it is known that its sum must not be a palindrome number.
Corollary 2: If the center (middle most position) of any natural number is the symmetry point, and the sum of the two numbers on the left and right symmetry positions is less than 10 (as the number of digits of the natural number is odd, the middle number is less than 5), then the sum obtained by adding the number and its inverted number must be palindromes.   We denote the non-palindrome with j which being obtained after adding a 0 at the most end of j', then     Because j is a non-palindrome number, it contains at least two numbers 1. We might as well set j i = 1, the rest number j 1 , j 2 , …, j k−1 , j k are all 0. Then 00 010 000 010 000 j =     .