intersection of numbers on wolfram

Question

After evaluations of the Riemann Hypothesis, with reflective thoughts over a year as to how to solve it, a formula that is very close has been found, if not distinctly the act of the original proof, with a different formula. The Riemann Zeta function is a technically perfect example of counting primes.

Here, I have linked the application of my formula to Wolfram Alpha.

https://www.wolframalpha.com/input/?i=plot+%28Re%28zeta%285%2F3t+i%29+-+Re%28zeta%281+%2B+152%2F9t+i%29%29++%2B++i%29%29+from+t+%3D+1000+to+1010

Since I cannot find how to do an intersection of primes and my numbers, I cannot tell how many I have or I am missing. That is the nature of my question. How do I know, or how can I find the answer I need to?

Answer 1

The answer is here

https://en.cppreference.com/w/cpp/numeric/special_functions/riemann_zeta

I (or you) can figure out what to do with this function, in C++.