加载中…
It is known, that under the assumption of the generalized Riemannian hypothesis, the function has infinitely many sign changes. In this article we give an upper bound for the least such sign change. Similarly, assuming the Riemannian hypothesis we give a lower bound for the number of sign changes of . The implied results for the least sign change are weaker then those obtained by numerical methods, however, our method makes no use of computations of zeros of the -function.

生成讲解博客的中文版本

生成AI智能校验的中文版本