The prime counting function conjecture

jrsousa2 · 2020-09-12, 19:39

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.

Batalov · 2020-09-12, 19:55

The reasoning behind posting here on this forum can be found here:

Quote:

Originally Posted by jrsousa2

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.

Dr Sardonicus · 2020-09-12, 21:33

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.

CRGreathouse · 2020-09-13, 04:04

Quote:

Originally Posted by jrsousa2

$\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?

2020-09-12, 19:39	#1
jrsousa2 Dec 2018 Miami 29₁₀ Posts	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

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Prime counting function records	D. B. Staple	Computer Science & Computational Number Theory	50	2020-12-16 07:24
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

2020-09-12, 21:33	#3
Dr Sardonicus Feb 2017 Nowhere 4186₁₀ Posts	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.