Jim Choate wrotes: > I've looked around, the only thing I can find is a paper by Y.K. Huen. > However, it requires a change in some definitions. The abstract I remember reading proved GC on a set of finite number fields of increasing size, and then inferred it for the integers at the end. The "proof" doesn't seem to have become famous, and yet, I don't recall it being publicly shot down either. Then some other group announced a big prize for proving GC recently, so I really have no clue as to what is going on. The distribution of prime numbers is completely determined once one classifies the zeros of the Riemann Zeta Function, so perhaps the Clay Math folks considered the inclusion of two problems on the structure of prime numbers redundant, and the Riemann Hypothesis to be the most important one. The Riemann Hypothesis, and NP=P, are of course the only problems in the seven with earthshaking implications for the face of Crypto As We Know It. -- Eric Michael Cordian 0+ O:.T:.O:. Mathematical Munitions Division "Do What Thou Wilt Shall Be The Whole Of The Law"
