Pseudoprimes and Other ResearchSaturday, April 21, 2007An Unconditional Improvement to the Running Time of the Quadratic Frobenius TestI am giving a talk at SERMON 2007 later today. Here are the slides.Posted by Jon 7:05 AM [0 comment(s)] Monday, December 11, 2006Things Have ChangedSince I last submitted that paper.
Still, the "rejection" was very encouraging, saying I would urge the author to submit his paper to a top-end number theory journal...So I will, but I have to do some further (minor) reformatting. Posted by Jon 7:30 AM [0 comment(s)] Tuesday, November 28, 2006New Version of "There Are Infinitely Many Perrin Pseudoprimes"I have reformatted There Are Infinitely Many Perrin Pseudoprimes (sometimes known as "There Are Infinitely Many Frobenius Pseudoprimes"). It now uses a more modern version of the TeX typesetting package. I also re-submitted it for publication after only 6 or 7 years. I think it holds up, though!Posted by Jon 2:32 PM [0 comment(s)] Tuesday, April 19, 2005Corrected SERMON slidesI have posted a corrected version of my slides from SERMON.Posted by Jon 11:25 AM [0 comment(s)] Thursday, April 14, 2005SERMON 2005 TalkI am giving a talk at the SERMON 2005 conference entitled, "Collecting primes with p2-1 827-smooth, or reduced sets for likely solutions to the $620 problem."Here are the slides. Posted by Jon 1:24 PM [0 comment(s)] Welcome to the BlogI have create this new weblog to post updates on my mathematical research. It will not necessarily be updated frequently, but will contain links to talks, papers, and other items of interest.Posted by Jon 1:23 PM [0 comment(s)] |
Home Weblog Archive Links Math Family Tree Gaming |