Zero counting function and prime order odd numbers computation

无限多非平凡的零点的位于同一直线上由德国Bernhard Riemann 数学家在1859年定义复平面上的复变函数方程zeta(s）/zeta(1-s)=2(2pi)^(s-1)sin(pi*s/2)gamma(1-s),the  solution each zero are non-trivial zero,it remained unproven and is central to understanding the general distribution of primes.a one million US dollars prize has been offered by the Clay mathematics Institutions for a proof.let s=x-i*tn was the solution of  each non-trival complex root,here n was any positive integer more than zero,when n was odd prime number,our zero counting function can precisely computing the value of Im(sn)=t(p) for example,10141 is a prime number ,t(p)=10^(4-1/t(8984))=pt(10141);t(10151)=10005.966..;p=10247,t(10247)=10087.772..。