primitive roots modulo p

[Bart Vandewoestyne]

Hello,

I am in the need of a function that gives me *all* primitive roots
modulo a certain prime.  After some googling, I've found that
Mathematica has a PrimitiveRoot[n] function...  Is there an
Octave-analogue out there somewhere?

If not, can anybody point me to a reference which lists an efficient
algorithm to find all primitive roots modulo a certain prime so I can
try to implement it myself (and share it with the community afterwards)?

Regards,
Bart

-- 
!!!!!!!!!!!!!!!!!!! email change !!!!!!!!!!!!!!!!!!!!!!!
My email address is now Bart.Vandewoestyne AT telenet.be
        Please update your addressbook!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!



-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.

Octave's home on the web:  http://www.octave.org
How to fund new projects:  http://www.octave.org/funding.html
Subscription information:  http://www.octave.org/archive.html
-------------------------------------------------------------