Article snapshot taken from Wikipedia with creative commons attribution-sharealike license.
Give it a read and then ask your questions in the chat.
We can research this topic together.
In mathematics, Turing's method is used to verify that for any given Gram pointgm there lie m + 1 zeros of ζ(s), in the region 0 < Im(s) < Im(gm), where ζ(s) is the Riemann zeta function. It was discovered by Alan Turing and published in 1953, although that proof contained errors and a correction was published in 1970 by R. Sherman Lehman.
For every integer i with i < n we find a list of Gram points and a complementary list , where gi is the smallest number such that
where Z(t) is the Hardy Z function. Note that gi may be negative or zero. Assuming that and there exists some integer k such that , then if
and
Then the bound is achieved and we have that there are exactly m + 1 zeros of ζ(s), in the region 0 < Im(s) < Im(gm).
Lehman, R. S. (1970). "On the Distribution of Zeros of the Riemann Zeta‐Function". Proceedings of the London Mathematical Society. s3-20 (2): 303–320. doi:10.1112/plms/s3-20.2.303.