Hi David, On Fri, Jul 31, 2009 at 7:31 PM, David Joyner<[email protected]> wrote: > > If you just recorded the smallest primitive roots I'll bet the database > would get a lot smaller:-) Do you need all the prim roots in the > CrypTool tutorial for a particular purpose, eg discrete logs?
That is part of a chapter on number theory for cryptography. The chapter discusses primitive roots so I introduced the Sage command primitive_root() and wrote some code to do simple calculations relating to primitive roots. > I'd guess a database of the smallest prim roots mod p for all primes > out to a million (for starters) would be interesting to some number-theorists. > I did a google search and could not find much online. Cool. Then I have a pretext to make more use of the machine sage.math :-) > I did find > > Western, A. E. and Miller, J. C. P. Tables of Indices and Primitive > Roots. Cambridge, England: > Cambridge University Press, pp. xxxvii-xlii, 1968, > > although I couldn't find what it had, and this page > http://www.ieeta.pt/~tos/p-roots.html > has a link to some related data. The author of that page also has done computations with the 3n + 1 conjecture. Earlier this year, I did some simple calculations relating to that conjecture. Perhaps I should revive that mini project. -- Regards Minh Van Nguyen --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
