Yuhang Shi

A computable transcendental number without eventually greedy best Egyptian underapproximations

We give a deterministic rational recursion defining a specific computable transcendental number whose best Egyptian underapproximations do not form an eventually nested chain. The construction first finds, inside any rational interval in (0,1), a smaller interval on which a presc...

A two-certificate trace-energy deduction for simple zeros of the Riemann zeta function

This preprint gives the research-draft candidate lower bound `liminf_{T->infinity} N_0^s(T,2T)/N(T,2T) >= 0.6733169771424713... > 0.673316977` for the proportion of simple zeros of the Riemann zeta function on thecritical line. The new step is finite-dimensional: certified seven-...