Wednesday, September 02, 2009

Grantham's Problem

(Cross-posted from my math blog, which I'm pretty sure nobody reads.)

While reviewing the referee's 44 (sigh) suggested changes to my paper, I came across an article published last November entitled "Inefficacious Conditions of the Frobenius Primality Test and Grantham's Problem".

I have a problem named after me!

So the next time someone asks me, "What's your problem?" I can say, "Are there any composite numbers n ≡ ±2 (mod 5) such that x^(n+1) ≡ 5 (mod(n, x^2 + 5x + 5))?"
Post a Comment