In binary, 1+ 1 is also equal to 10. Hello! This question was put forward by the German mathematician C Goldbach (1690- 1764) in a letter to the great mathematician Euler on June 7th, 742, so it is called Goldbach conjecture. On June 30th of the same year, Euler replied that this conjecture may be true, but he could not prove it. Since then, this mathematical problem has attracted the attention of almost all mathematicians. Goldbach conjecture has therefore become an unattainable "pearl" in the crown of mathematics. "In contemporary languages, Goldbach conjecture has two contents, the first part is called odd conjecture, and the second part is called even conjecture. Odd number conjecture points out that any odd number greater than or equal to 7 is the sum of three prime numbers. Even conjecture means that even numbers greater than or equal to 4 must be the sum of two prime numbers. " (Quoted from Goldbach conjecture and Pan Chengdong) Goldbach conjecture seems simple, but it is not easy to prove, which has become a famous problem in mathematics. In 18 and 19 centuries, all number theory experts did not make substantial progress in proving this conjecture until the 20th century. It is directly proved that Goldbach's conjecture is not valid, and people adopt "circuitous tactics", that is, first consider expressing even numbers as the sum of two numbers, and each number is the product of several prime numbers. If the proposition "every big even number can be expressed as the sum of a number with no more than one prime factor and a number with no more than b prime factors" is recorded as "a+b", then the Coriolis conjecture is to prove that "1+ 1" holds. 1900, Hilbert, the greatest mathematician in the 20th century, listed Goldbach conjecture as one of the 23 mathematical problems at the International Mathematical Congress. Since then, mathematicians in the 20th century have "joined hands" to attack the world's "Goldbach conjecture" fortress, and finally achieved brilliant results. In the 1920s, people began to approach it. 1920, the Norwegian mathematician Bujue proved by an ancient screening method that every even number greater than 6 can be expressed as (9+9). This method of narrowing the encirclement is very effective, so scientists gradually reduce the number of prime factors of each number from (99) until each number is a prime number, thus proving Goldbach's conjecture. 1920, Bren of Norway proved "9+9". 1924, Rademacher proved "7+7". 1932, Esterman of England proved "6+6". 1937, Ricei of Italy proved "5+7", "4+9", "3+ 15" and "2+366" successively. 1938, Byxwrao of the Soviet Union proved "5+5". 1940, Byxwrao of the Soviet Union proved "4+4". 1948, Hungary's benevolence and righteousness proved "1+c", where c is the number of nature. 1956, Wang Yuan of China proved "3+4". 1957, China and Wang Yuan successively proved "3+3" and "2+3". 1962, Pan Chengdong of China and Barba of the Soviet Union proved "1+5", and Wang Yuan of China proved "1+4". 1965, Byxwrao and vinogradov Jr of the Soviet Union and Bombieri of Italy proved "1+3". 1966, China and Chen Jingrun proved "1+2" [in popular terms, it means even number = prime number+prime number * or even number = prime number+prime number (Note: the prime numbers that make up even numbers cannot be even numbers, but only odd numbers. Because there is only one even prime number in the prime number, that is 2. )]。 The "s+t" problem refers to the sum of the product of S prime numbers and the product of T prime numbers. The main methods used by mathematicians in the 20th century to study Goldbach conjecture are screening method, circle method, density method and trigonometric sum method. The way to solve this conjecture, like "narrowing the encirclement", is gradually approaching the final result. Thanks to Chen Jingrun's contribution, mankind is only one step away from the final result of Goldbach's conjecture "1+ 1". But in order to achieve this last step, it may take a long exploration process. Many mathematicians believe that to prove "1+ 1", new mathematical methods must be created, and the previous methods are probably impossible. There is another saying: 1+ 1=2 can prove it. Of course, this is not the so-called Goldbach conjecture. To prove that 1+ 1=2, Piano Axiomatic Piano (Peano, 1858- 1932) is Italian. (1) "1"is a natural number; (2) Every certain natural number A has a certain successor A', and A' is also a natural number (the successor of a number is the number immediately after this number, for example, the successor of 1 is 2, the successor of 2 is 3, and so on. ); (3) If both B and C are successors of natural number A, then B = C；; (4) 1 is not the successor of any natural number; (5) Any proposition about natural numbers holds for all natural numbers. If it holds for natural number 1 and for natural number n, it can be proved that it holds for n'. It is proved that the successor of 1+ 1 is the successor of 1, that is, the successor of 3 2 is 3. According to piano's axiom (4), it is 1+ 1=2, so 1+65438 = 65438. Thank you. For spelling, give points!