Thursday, November 12, 2009

Even newer version of paper!

The referee had 9 additional suggestions after receiving my previous revision. I incorporated 8 of them, and the paper has now officially been accepted by the Journal of Number Theory. The latest version is here.

Thursday, October 22, 2009

Elliptic Pseudoprimes

Mathematics of Computation recently published an article by Siguna Müller entitled, "On the existence and non-existence of elliptic pseudoprimes". She refers to two of my papers (references [7] and [8]).

I have not looked much at elliptic pseudoprimes. In particular, in my 2001 paper, "Frobenius Pseudoprimes", I say,
This paper does not pretend to be an exhaustive treatment of all notions of pseudoprimality. For example, nothing is said about elliptic pseudoprimes [8].
Maybe I should look at them some more.

Tuesday, September 29, 2009

Newer version of paper!

I have incorporated the referee's 44 suggestions and made other changes. The newest version of the paper is available here. The editor is sending it back to the referee. Hopefully this merry-go-round will stop soon!

Wednesday, September 02, 2009

Grantham's Problem

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))?"

Monday, March 23, 2009

New Version of Paper

Well, this time I didn't take 6 or 7 years. After slightly more than two years, I've revised There Are Infinitely Many Perrin Pseudoprimes again. I used a more modern version of the journal's style guide, and I incorporated some comments an editor suggested. Now hopefully it'll go off to another editor (don't ask) and a referee!