Growth rate of Prime zeta function
What would be the asymptotic growth rate of
or for the special cases
or })
I tried using the relation
but couldn't get it to work. How many terms would you require to compute
and
to 20 digits using direct computation??
(Shake)
Re: Growth rate of Prime zeta function
Quote:
Originally Posted by
mathematicaphoenix
What would be the asymptotic growth rate of
})
or for the special cases
})
or
})
I tried using the relation
)
but couldn't get it to work. How many terms would you require to compute
})
and
})
to 20 digits using direct computation??
(Shake)
By definition is...
(1)
... and it is immediate to verify that...
(2)
... so that is...
(3)
Kind regards

Re: Growth rate of Prime zeta function
Quote:
Originally Posted by
chisigma
By definition is...
=\sum_{p} \frac{1}{p^{s}})
(1)
... and it is immediate to verify that...
=1)
(2)
... so that is...
 \sim \frac{1}{2^{s}})
(3)
Kind regards

I got that result. But how would you use (3) to calculate the the number of terms required to get
to a given accuracy using direct calculation.
For example, for
I have already found that, to get
digits of accuracy you would require

terms. I want to do a similar thing with
. Can you help?
Thanks
(Hi)
Re: Growth rate of Prime zeta function
Quote:
Originally Posted by
mathematicaphoenix
I got that result. But how would you use (3) to calculate the the number of terms required to get
)
to a given accuracy using direct calculation.
For example, for
)
I have already found that, to get

digits of accuracy you would require

terms. I want to do a similar thing with
)
. Can you help?
Thanks
(Hi)
If You intend to use that formula, then what You can do is to extimate the minimum value of s that gives an error
. If You write...
(1)
... then the condition is approximately...
(2)
If You uses two terms of the series writing
then You write...
(3)
... and the condition is approximately...
(4)
Now You can proceed increasing the terms till to arrive to the required accuracy...
Kind regards

Re: Growth rate of Prime zeta function
Quote:
Originally Posted by
chisigma
If You intend to use that formula, then what You can do is to extimate the minimum value of s that gives an error

. If You write...
= \frac{1}{2^{s}} + \varepsilon (s))
(1)
... then the condition is approximately...

(2)
If You uses two terms of the series writing
 \sim \frac{1}{2^{s}} + \frac{1}{3^{s}})
then You write...
= \frac{1}{2^{s}} + \frac{1}{3^{s}}+ \varepsilon (s))
(3)
... and the condition is approximately...

(4)
Now You can proceed increasing the terms till to arrive to the required accuracy...
Kind regards

Isn't there a way to derive a simple formula such as that for the )
Re: Growth rate of Prime zeta function
Re: Growth rate of Prime zeta function
Quote:
Originally Posted by
chisigma
Of course the approximate relation

valid for
)
is valid for
)
using p instead of n...

(1)
Kind regards

If I apply (1) to get an approximation for 20 digits of
I get a value that's 10 orders of magnitude less. I should get
(P. Sebah et.al.) What should I do?
Thanks