back to table · edit · history · where entries came from · files · download
619 bytes, as of the version from 2026-11-16 22:11 (current). Recorded here, not run.
import mpmath as mp
mp.mp.dps = 165
def minus_q(t):
s = mp.mpf(1)/2 + mp.j*t
d1, d2, d3 = [mp.zeta(s, derivative=k) for k in (1, 2, 3)]
u = 1/s + 1/(s-1) - mp.log(mp.pi)/2 + mp.digamma(s/2)/2
up = -1/s**2 - 1/(s-1)**2 + mp.polygamma(1, s/2)/4
v, w = d2/d1, d3/d1
return w - v*v - u*v + 3*up - u*u
def strong_pair_lhs(n):
a, b = [mp.im(mp.zetazero(k)) for k in (n, n+1)]
s = (b-a)**2 * (minus_q(a)+minus_q(b))
assert abs(mp.im(s)) < mp.mpf('1e-140')
return mp.re(s)
print(mp.nstr(strong_pair_lhs(101), 100))
# Approximation only; this program supplies no rigorous error bound.