Compute nontrivial zeros of Riemann zeta function is an algebraically complex task. However, if someone able to prove such an iterative formula can be used to get all approximate nontrivial using an iterative formula, then its value is limitless.How ever to prove such an iterative formula is kind of a huge challenge. If somebody can proved such a formula what kind of impact will produce to Riemann hypothesis? . Also accuracy of approximately calculated non trivial accept as close calculation to non trivial zeros ?
Here I have been calculated and attached first 50 of approximate nontrivial using an iterative such formula that I have been proved. Also it is also can be produce millions of none trivial zeros. But I am very much voirie about its appearance of its accuracy !!. Are these calculations Is ok?
In a paper that can be found on arXiv or at Article An electrostatic depiction of the validity of the Riemann Hy...
, LeClair gives a reasonably accurate algorithm to estimate the non-trivial zeros up to 10^200=Googol^2. My paper that can be found at Cogent Mathematics, on arxiv or RGResearch Exploring Riemann's Functional Equation - Final version
gives an estimate that bounds the n'th zero and checks LeClairs result for the number Googol. Although both these are not iterative, and work only for non-trivial zeros that sit on the critical line, they are predictive and easily calculated. Once a zero is estimated, or bounded, it's accurate value can then be found from formula given.
You can check this preprint it may help you:
https://www.researchgate.net/publication/338387958_Computing_some_numerical_roots_of_the_zeta-function_using_WolframAlpha
- Badges
- Science topic
- Similar topics
- Engineering
- Computer Engineering
- Computer