I watched a video explaining that using the non-trivial zeros of the Riemann zeta function, we can approximate the prime counting function to have a pretty high accuracy
I would like to know, how many zeros we must have (find) to obtain all primes less than 100 for example ? or this doesn't work like that ? if so what can we benefit from two or three zeros (let's say the first ones) ?
Also, why is this a "high accuracy", and not exact result ?
video link time 15:45 : https://youtu.be/dktH8hJadyU?t=948