mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-09-12, 19:39   #1
jrsousa2
 
Dec 2018
Miami

29 Posts
Default The prime counting function conjecture

Don't swallow me alive for this, but I was wondering if somebody can be kind enough to test this conjecture with a large enough say x>50 using a powerful computer:

\pi(x) \sim -16\sum _{h=1}^{\infty}\frac{x^{2h+1}}{2h+1}\sum _{i=1}^h \log\zeta(2i)\sum _{v=i}^{h}\frac{(-1)^{h-v}(4\pi )^{2h-2v}}{\zeta(2v-2i)(2h+2-2v)!} \text{, if }x\text{ is sufficiently large.}

If you can let me know, and am willing to provide you with the typed out formula to be used in your math software.
Notice this formula assumes 1 is not a prime (as it should.)

The reasoning behind it can be found here.

Last fiddled with by jrsousa2 on 2020-09-12 at 19:42
jrsousa2 is offline   Reply With Quote
Old 2020-09-12, 19:55   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

5×1,831 Posts
Default

The reasoning behind posting here on this forum can be found here:
Quote:
Originally Posted by jrsousa2 View Post
If you know how one deletes their account here, let me know. It will be my pleasure to leave this forum and its forumers, only non-sense and trolls and BS from you idiots.
This site is rather abusive too, disabling us to delete topics and posts.
I'm fed up and want out. You people suck, as does this forum.

ADMIN\MOD, AS SOON AS YOU SEE THIS, PLEASE DELETE MY ACCOUNT.
As they say, when you hate a place, shrug the dust of your shoes, leave and never go back. Why did I come back.
Very consistent.
Batalov is offline   Reply With Quote
Old 2020-09-12, 21:33   #3
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

72778 Posts
Default

I question the use of the term "conjecture," which, as explained here, implies the statement is important and worthy of study. The term "claim" appears to be more appropriate. Offhand, I see no reason to consider it, even if correct, as anything other than a curiosity.

The claim is also poorly stated. The phrase "if x is sufficiently large" is entirely superfluous. The definition of asymptotic equality involves the limit as x increases without bound, or tends to plus infinity.

Your request indicates to me that your series is difficult to evaluate. There are already expressions proven to be asymptotically equal to the prime-counting function, such as li(x) and x/log(x), which are easy to evaluate.
Dr Sardonicus is offline   Reply With Quote
Old 2020-09-13, 04:04   #4
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

10111001100102 Posts
Default

Quote:
Originally Posted by jrsousa2 View Post
\pi(x) \sim -16\sum _{h=1}^{\infty}\frac{x^{2h+1}}{2h+1}\sum _{i=1}^h \log\zeta(2i)\sum _{v=i}^{h}\frac{(-1)^{h-v}(4\pi )^{2h-2v}}{\zeta(2v-2i)(2h+2-2v)!} \text{, if }x\text{ is sufficiently large.}
What are you taking the log of? If it's just the zeta, I don't get convergence. If it's the whole inner sum, what branch are you taking?
CRGreathouse is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime counting function records D. B. Staple Computer Science & Computational Number Theory 49 2020-11-06 22:02
New confirmed pi(10^27), pi(10^28) prime counting function records kwalisch Computer Science & Computational Number Theory 34 2020-10-29 10:04
Is there a power-counting function? enzocreti enzocreti 10 2020-02-15 13:23
Prime counting function Steve One Miscellaneous Math 20 2018-03-03 22:44
Legendre's prime counting function pbewig Information & Answers 0 2011-07-14 00:47

All times are UTC. The time now is 18:59.

Mon Nov 23 18:59:38 UTC 2020 up 74 days, 16:10, 1 user, load averages: 3.58, 3.03, 2.73

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.