Is There a Way to Solve the Integral Equation for Pi(x) Numerically?

  • Context: Graduate 
  • Thread starter Thread starter lokofer
  • Start date Start date
  • Tags Tags
    Integral
Click For Summary

Discussion Overview

The discussion revolves around the numerical solution of the integral equation for the prime counting function \(\pi(x)\) derived from Euler's product. Participants explore the feasibility of using numerical methods, such as quadrature and the Resolvent Kernel approximation, to compute \(\pi(x)\) and debate the efficiency of these approaches compared to direct computation.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant suggests that \(\pi(x)\) can be obtained from the integral equation involving the logarithm of the Riemann zeta function and proposes using numerical methods for evaluation.
  • Another participant argues that while algorithms exist for both calculating \(\pi(x)\) and evaluating integrals, the cost of using the integral approach may outweigh the benefits compared to direct computation of \(\pi(x)\).
  • A different viewpoint introduces the Resolvent Kernel approximation as a potential method to compute \(\pi(x)\), suggesting that with modern computing power, it might be feasible to calculate the kernel iteratively.
  • One participant questions the rationale behind not computing \(\pi(x)\) directly, emphasizing the importance of cost estimation in choosing the method of evaluation.

Areas of Agreement / Disagreement

Participants express differing opinions on the efficiency and practicality of using numerical methods versus direct computation for \(\pi(x)\). There is no consensus on the best approach, and the discussion remains unresolved regarding the optimal strategy for obtaining \(\pi(x)\).

Contextual Notes

Participants highlight the complexity of evaluating functions defined by infinite series and the associated computational costs. There are unresolved considerations regarding the assumptions behind the proposed numerical methods and their practical implementation.

lokofer
Messages
104
Reaction score
0
Hello..that's my question today..why can't we obtain \pi(x) by solving the integral equation obtained from Euler's product:

\frac{log \zeta(s)}{s}= \int_{2}^{\infty}dx \frac{ \pi(x)}{x(x^{s}-1)} ?

- Of course we can't solve it "Analytically" (or perhaps yes, i will take a look to "Numerical Recipes"... ) but we could solve it Numerically using some quadrature method for the Integral equation..or introducing the term inside the Kernel:

\pi(s) = \int_{2}^{\infty} \pi(x) \delta (x-s) so the integral becomes a "Fredholm Integral Equation of Second Kind"... I know that an algorithm (either numerical or similar) must exist to solve any Integral equation Numerically...why not for the Prime counting function?...
 
Physics news on Phys.org
Look, Jose, a naive algorithm exists for calculating pi(x), and one exists for evaluating integrals. Now, try to estimate for your self which is more expensive.

In the several years you've been posting here you have never managed to distinguish between a function and an algorithm for evaluating a function at a given point. Numerically you can do anything you want to anything you wish, but it all costs time and 'mathematical money'. So why don't you work out the cost of estimating firstly the functions you wish to use,and thence the integral, and then see if it is better or worse than just working out pi(x) by hand?

Here's a rough heuristic as to why what you've done doesn't seem like a saving:

pi(x) is a perfectly well defined 'analytic' expression. We can work out its values relatively cheaply.

you have replaced pi(x) with another function that is defined in terms of an infinite series, then you've used an integral that can only be done numerically, all of which 'cost money' to approximate, even if there were a way to recover pi(x) from that expression.
 
Last edited:
You could use the Resolvent Kernel approximation to obtain [\tex] \pi(x) [/tex] :

\int_{2}^{\infty}ds R(x,s) \frac{log \zeta (s)}{s}= \pi(x)

Thta's what i would use..in fact Matt I'm not mathematician, I'm just a physicist suffering unemployment..i don't know much about algorithms :rolleyes: but i think that with a "good" computer today you could calculate the "Resolvent" kernel by iterations or other method.. perhaps in a pair of months you could obtain R(x,s) the rest is easy..
 
And why can't a good computer just work out pi(x) directly even more quickly?

And you can't pull the 'I'm not a mathematician' line again. You've been given years of advice here, it is not our fault you choose to ignore it. It has been explained to you many many times, that just because you can rearrange some symbols does not make it easier to evaluate. It is up to you to work out the estimates of cost, and as a physicist your are in a far better position to do that than a mathematician (estimates, asmyptotics, numerics etc).
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
863
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 5 ·
Replies
5
Views
4K