Prime Counting Function

mardi 1 avril 2014

Dear fellow learners,



Through an extracurricular project I have found a really cool equation to count primes. The equation can evaluate

Pi(x)+Pi(√x)/2+Pi(cubedroot(x))/3+...Pi(nthroot(x))/n



I have directly proved my equation so I now it will be accurate 100% of the time. Although the equation is cumbersome my prof thinks it is a really cool idea and that I should either try and use it to prove some prime conjectures or simply publish it. However, he is not a specialist in number theory and suggests I consult several forums to find any equations that resemble mine.



So, my question: are there any equations that can calculate

Pi(x)+Pi(√x)/2+Pi(cubedroot(x))/3+...Pi(nthroot(x))/n?



Thanks everyone for your time!





0 commentaires:

Enregistrer un commentaire