Distribution of prime numbers Fundamental Theorem Dan Liu



Similar documents
If n is odd, then 3n + 7 is even.

8 Primes and Modular Arithmetic

Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Full and Complete Binary Trees

Counting Primes whose Sum of Digits is Prime

Continued Fractions. Darren C. Collins

Zeros of a Polynomial Function

Theorem3.1.1 Thedivisionalgorithm;theorem2.2.1insection2.2 If m, n Z and n is a positive

THE PRIME NUMBER THEOREM AND THE RIEMANN HYPOTHESIS. A marriage of calculus and arithmetic. BERNARD RUSSO University of California, Irvine

Grade 6 Math Circles March 10/11, 2015 Prime Time Solutions

Total colorings of planar graphs with small maximum degree

SECTION 10-2 Mathematical Induction

TEXAS A&M UNIVERSITY. Prime Factorization. A History and Discussion. Jason R. Prince. April 4, 2011

Introduction. Appendix D Mathematical Induction D1

Note on some explicit formulae for twin prime counting function

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

Grade Level Year Total Points Core Points % At Standard %

Homework until Test #2

Computing exponents modulo a number: Repeated squaring

Math Workshop October 2010 Fractions and Repeating Decimals

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

Lesson on Repeating and Terminating Decimals. Dana T. Johnson 6/03 College of William and Mary

FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY

Warm up. Connect these nine dots with only four straight lines without lifting your pencil from the paper.

The positive integers other than 1 may be divided into two classes, prime numbers (such as 2, 3, 5, 7) which do not admit of resolution into smaller

Fault Analysis in Software with the Data Interaction of Classes

Primes in Sequences. Lee 1. By: Jae Young Lee. Project for MA 341 (Number Theory) Boston University Summer Term I 2009 Instructor: Kalin Kostadinov

3 Some Integer Functions

CONCEPTUAL MODEL OF MULTI-AGENT BUSINESS COLLABORATION BASED ON CLOUD WORKFLOW

Kevin James. MTHSC 412 Section 2.4 Prime Factors and Greatest Comm

Basic Proof Techniques

mathematical community as well as many others. He is considered by many to be one of the

Solution to Exercise 2.2. Both m and n are divisible by d, som = dk and n = dk. Thus m ± n = dk ± dk = d(k ± k ),som + n and m n are divisible by d.

Factoring Polynomials

Solving Rational Equations

Ira Fine and Thomas J. Osler Department of Mathematics Rowan University Glassboro, NJ Introduction

ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS

8 Divisibility and prime numbers

Five fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms

1.2. Successive Differences

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Number Theory. Proof. Suppose otherwise. Then there would be a finite number n of primes, which we may

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

I. The Establishment and Development of Teaching of Traditional Chinese Instrumental Music Theory in the 20 th Century


Elementary Number Theory

MATH 289 PROBLEM SET 4: NUMBER THEORY

Pythagorean Triples. becomes

arxiv: v2 [math.ho] 4 Nov 2009

Sample Induction Proofs

Preface... 5 Arithmetic Functions The Euler-Maclaurin Summation Formula Average Orders The Riemann ζ-function...

Handout #1: Mathematical Reasoning

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

Our Primitive Roots. Chris Lyons

Continued Fractions and the Euclidean Algorithm



An Efficient RNS to Binary Converter Using the Moduli Set {2n + 1, 2n, 2n 1}

Just the Factors, Ma am

6.2 Permutations continued

3. Mathematical Induction

THE SINE PRODUCT FORMULA AND THE GAMMA FUNCTION

Doug Ravenel. October 15, 2008

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

Page 331, 38.4 Suppose a is a positive integer and p is a prime. Prove that p a if and only if the prime factorization of a contains p.

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Set Theory Basic Concepts and Definitions

Unit 1 Number Sense. In this unit, students will study repeating decimals, percents, fractions, decimals, and proportions.

One advantage of this algebraic approach is that we can write down

Trigonometric Functions and Equations

Tricyclic biregular graphs whose energy exceeds the number of vertices

0 0 such that f x L whenever x a

Mathematical Induction. Mary Barnes Sue Gordon

Congruent Number Problem

Radius, Diameter, Circumference, π, Geometer s Sketchpad, and You! T. Scott Edge

The Mathematics of the RSA Public-Key Cryptosystem

Collatz Sequence. Fibbonacci Sequence. n is even; Recurrence Relation: a n+1 = a n + a n 1.

*SB0179* S.B. 179 S.B MATH EDUCATION INITIATIVE. LEGISLATIVE GENERAL COUNSEL 6 Approved for Filing: A.O. Stallings :29 PM 6

E-learning in China Qiyun Wang National Institute of Education, Nanyang Technological University, Singapore

10/14/08 ON NUMBERS EQUAL TO THE SUM OF TWO SQUARES IN MORE THAN ONE WAY

We can express this in decimal notation (in contrast to the underline notation we have been using) as follows: b + 90c = c + 10b

SOLVING POLYNOMIAL EQUATIONS

Algebraic and Transcendental Numbers


On the largest prime factor of x 2 1

Alex, I will take congruent numbers for one million dollars please

FINITE FIELDS KEITH CONRAD

A Note on Sums of Greatest (Least) Prime Factors

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

Observation on Sums of Powers of Integers Divisible by Four

Wireless Sensor Networks Coverage Optimization based on Improved AFSA Algorithm

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

4.2 Euclid s Classification of Pythagorean Triples

Lecture 21 and 22: The Prime Number Theorem

Transcription:

Bulletin of Mathematical Sciences and Applications Online: 2013-02-04 ISSN: 2278-9634, Vol. 3, pp 45-48 doi:10.18052/www.scipress.com/bmsa.3.45 2013 SciPress Ltd., Switzerland Distribution of prime numbers Fundamental Theorem Dan Liu Department of Mathematics, Chinese sichuan Neijiang Teachers University, Chinese, P.R.China. Keywords: prime number; density; theorem; calculation. Abstract: In 1849, the German mathematician Gauss large average distribution density of primes near x. Based on the density of the Gauss proposed regional distribution of prime numbers theorem. And regional distribution of prime numbers theorem proved easy to understand way. The fundamental theorem to obtain the distribution of prime numbers. Thus proving that a new prime number theorem. Therefore gives the details of the calculation. 1 Introduction In 1849, the German mathematician Gauss to Encke's letter said that, from 1792 to 1793 by examining the number of prime numbers in the period of 1000 adjacent integer, found a large x primes average distribution density should as follows: by (1), Points [1],[2],[3],[5],[6]: (1) (2) This (2) is called: the prime number theorem. According to Gauss investigation, this paper proposed the primes distribution theorem and proof area. The fundamental theorem to obtain the distribution of prime numbers. This has proved a another prime number theorem. 2 Gauss density Set a large number x, the density of primes the number of π (x, y), get: This (3) as: Gauss density. For example: Let x = 100000000, y = 99995200, by (3) calculated as follows: (3) The calculations show that the theory and practice is very close. Set x = 100000000, λ = 1.000048, by (4) Calculate: The actual number π (x, x/ λ) = 259, (4) Theoretical number The calculation shows that very close to the actual number. However, after all, are not equal. Can be equal? SciPress applies the CC-BY 4.0 license to works we publish: https://creativecommons.org/licenses/by/4.0/

46 Volume 3 3 The regional distribution of prime numbers theorem Set a large number x, the prime number p, the number of prime numbers is π (x, x / λ),get [7] 115,[8] 112 : (5) This (5) called: Regional distribution of prime numbers theorem. This is the the Gauss density of origin. For example: Let x = 100000000, λ = 1.000048, by (5) Calculate: The calculations show that the remainder is ignored 0.00028 integer is equal to the actual number 259, Proof: Set a large number x, λ Approaching 1, the prime numbe p, Series and an integer, Clear: (6) For example: Let x = 100000000, λ = 1.000048, by (6) and of the series 1.0000010810530266, To ignore 0.0000010810530266, integer 1, By (6) get: By (7) get: (7) Theorem (5) is proved. 4 The distribution of prime numbers Fundamental Theorem By (5) get: (8) This (8) is called: the distribution of prime numbers Fundamental Theorem. density function u (x) is called. For example: Let x = 256, a = 16, [a / 2] = 8, λ = 1.41421356, by (8) get: Actual π(256) = 54, The calculations show that ignore 0.23919131, Integer 54, And the actual number is equal. x is the greater, the smaller the remainder.

Bulletin of Mathematical Sciences and Applications Vol. 3 47 By (8) get: By (9) Convert: s(x) < 2π(x), (9) Thus: (10) By (9) get: By (10),(11) get By (12) get The prime number theorem. 5 Mertens Theorem In 1874, mathematician Mertens prove[5] 11 This (13) is: Meitens Theorem. (13) by (14) get (14) by (15) Substituting (8), get: this (16) and Li (x) are 1/lnx integrator. Therefore: For example: Let x = 100000000, λ = 1.0000003684136828, a = 48642829, By (16) get s (100000000) = 5762209, By (2) get Li (100000000) = 5762209, 6 Proved a prime number theorem By (12), (17) get: This (18) is a new prime number theorem. Is equivalent to the ideal formula of Riemann. (17) (18) 7 To continue the discussion After reading this, I believe that the Fundamental Theorem already have a clear understanding of the distribution of prime numbers. Theorem density from Gauss to the regional distribution of prime numbers, Fundamental Theorem to the distribution of prime numbers. Then prove a new prime number theorem. Get a function equal to π (x) for the distribution of prime numbers, many complex issues, such as Jie Bove conjecture, Goldbach conjecture, twin primes conjecture, Riemann Guess would like to become clear through the end, easy to understand.

48 Volume 3 Riemann formula is an approximation to π (x) function, its discovery and proof is so difficult. You can imagine, it is a function of π (x) is equal to what is not easy to discover and prove. Even if you want to get a π (x) is equal to the conjecture is not easy. By (8) Can also be obtained from : For sufficiently large x, another new prime number theorem: This is beyond this topic, Not be discussed in detail. Thanks: Chinese Taipei, Mr. Chen, Professor Qin Ji. Huazhong University of Science and Technology Professor Lu Yuanhong. Zhao Lu, Shandong Zaozhuang II teacher computer programming. References [1] Manin (Russia) and other. (2006). modern number theory guided.the Science Press. [2] Hua.(1979). number theory guide.science Press. [3] (Germany), Neukirch.(2007). Algebraic Number Theory. Science Press. [4] Hua, Wang Yuan.(1963). numerical integration and its application. Science Press. [5] Pan Cheng-dong, the Pan Chengbiao.(1988). prime number theorem, elementary proof of the.shanghai Science and Technology Press. [6] Lu Changhai.(2004). (USA). Riemann hypothesis. [7] Dan Liu.(2011). Distribution of prime numbers iterated function.canadian mathematics research. [8] Dan Liu.(2012). Conversion of the Riemann prime number formula. Asian Journal of Mathematics (SAJM)

Volume 3 10.18052/www.scipress.com/BMSA.3 Distribution of Prime Numbers Fundamental Theorem 10.18052/www.scipress.com/BMSA.3.45 DOI References [3] (Germany), Neukirch. (2007). Algebraic Number Theory. Science Press. 10.1007/978-3-662-03983-0_1 [7] Dan Liu. (2011). Distribution of prime numbers iterated function. Canadian mathematics research. 10.5539/jmr.v3n4p112