This is from the guy who wrote prime_pi:
---------- Forwarded message ---------- From: R. Andrew Ohana <oha...@u.washington.edu> Date: Mon, May 4, 2009 at 1:30 PM Subject: Meeting To: William Stein <wst...@gmail.com> Hey, Sorry, been away from technology for a bit. I unfortunately do not have access to any 32-bit sage installs presently, and looking back at my code, I don't see anything that is really jumping out at me as to why there is a disagreement. Agreed that for now have 2^40 be the upper bound -- I haven't tested much beyond that. If anyone is interested in implementing the Lagarias, etc. algorithm, I'll post some starter code I have when I am back to my machines (it should be much more readable for anyone familiar with prime counting algorithms). -Andrew -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
