• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Better prime counting formula
 

Better prime counting formula

on

  • 446 views

In this document, we will show a better approximation for the prime-counting function proposed by Bernhard Riemann.

In this document, we will show a better approximation for the prime-counting function proposed by Bernhard Riemann.

Statistics

Views

Total Views
446
Views on SlideShare
446
Embed Views
0

Actions

Likes
0
Downloads
3
Comments
0

0 Embeds 0

No embeds

Accessibility

Upload Details

Uploaded via as Adobe PDF

Usage Rights

CC Attribution-NonCommercial LicenseCC Attribution-NonCommercial License

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Better prime counting formula Better prime counting formula Document Transcript

    • Author : chrisdecorte@yahoo.com Page 1 Better approximation for π(x) II Author: Chris De Corte KAIZY BVBA Beekveldstraat 22 bus 1 9300 Aalst Belgium Tel: +32 495/75.16.40 E-mail: chrisdecorte@yahoo.com
    • Author : chrisdecorte@yahoo.com Page 2 Abstract In this document, we will show that: ߨሺ‫ݔ‬ሻ = ‫ݔ‬ 2 . [1 − ඨ1 − 4 lnሺ‫ݔ‬ሻ ] − 7 might be a better approximation for the prime-counting function than ߨሺ‫ݔ‬ሻ = ‫[/ݔ‬lnሺ‫ݔ‬ሻ − 1] proposed by Bernhard Riemann [1]. Key-words prime number theorem (PNT), prime-counting function, asymptotic law of distribution, Riemann hypothesis, Clay Mathematics. Introduction The following document originated during our study of primes and the reading about the Riemann hypothesis [2,3]. We were baffled by the fact that the young Riemann had found such a complex formula as a proposition for to the prime-counting function. We were curious to find a better formula. Methods & Techniques We used Microsoft Excel to do our calculations.
    • Author : chrisdecorte@yahoo.com Page 3 Results Below, one can find the calculation results in table form: Below, one can find the comparative error on a chart:
    • Author : chrisdecorte@yahoo.com Page 4 Discussions: Conclusion: 1. Our formula gives better results Acknowledgements I would like to thank this publisher, his professional staff and his volunteers for all the effort they take in reading all the papers coming to them and especially I would like to thank this reader for reading my paper till the end. I would like to thank Jens Kruse Andersen, David Eppstein and Renaud Lifchitz for taking the time to react to my mails. References 1. https://en.wikipedia.org/wiki/On_the_Number_of_Primes_Less_Than_a_Given_ Magnitude 2. http://en.wikipedia.org/wiki/Prime_number_theorem 3. https://en.wikipedia.org/wiki/Riemann_hypothesis