Some computer scientists in India have come up with a new and elegant method of determining if a number is prime. It's deterministic, rather than the probabilistic methods presently used.

It probably won't replace current methods in cryptography, though--it's actually slower than standard numerical techniques.

Sure, it's of no current practical use in cryptography...but, deterministic? I'll have to back track over some maths that I'll (thankfully), but if this method holds up, I think it blows some rather large holes in our understanding of number theory.