TheFormulaofPrimeNumbersandProofofConjectureLI.docVIP

The Formula of Prime Numbers and Proof of Conjecture LI Lian - zhong LI Jing(1. Yingshan Middle School, Sichuan Yingshan 637700 e-mail:lianzhong.li2008@163.com,phone2. IBM Beijing, China)Abstract: In this paper, we prove the continuous product formula, the prime number continuous function formula, the prime number even product inequality, and prove the Riemann conjecture, twin prime conjecture, Bach conjecture and so on，as well as their corresponding formulas.     Key words: number theory; prime number; formula; conjectureCLC number: 015 Document code: Article ID: Lemma: if ,,……, are consecutive prime numbers, 1≤j≤i, and| n ,1≤m≤n , then the number of m≠0(mod) is : . Proof: I. when i=1, ∵ =2 , |n ∴ The statement is true. Ⅱ.Assume i=k, the statement is true: When i=k+1, ∵ |n，|n，…， |n (induction hypothesis) ∴ Because |n , the number of m=o (mod) is , remove the multiples of ，，…, the rest is: ∴ ∴ when i=k+1, statment is true. Since both the basis I and the inductive step Ⅱ have been performed, by mathematical induction,  when i is any positive integer, the statement is true. Conclusion is proved. Corollary 1: If,，……,,for the continuous prime number,1≤j≤i,and,| n，then The m congruence classes of the modulo Pj are removed from n consecutive integers of 1 to n(With congruence class 0, Pj ≤ m leave a congruence class),The remaining number Theorem1: (product formula of prime number): If,，……,,is consecutive prime numbers, , not greater than the integer number of prime number n is denoted by π (n), then the formula π（n）=2+ +g(n) (－g(n) ,λmicro single reduction.) Proof： ∵ n＝1+(－1)+(－)+…++…+ Integer of interval (),After removing the multiple Of ,，…, the remainder are all prime numbers. (4, 9),(9,25) and (25,49) are calculated by lemma, plus the error of rounding up or