\\% Maximal order modulo n
\\ Author: Joerg Arndt
\\ License: GPL version 3 or later
\\ online at http://www.jjj.de/pari/
\\ version: 2011-January-19 (12:50)

maxorder(n)=
{
    local(z, mo);
    if ( n<=2, return( 1 ) );
    z = znstar(n)[2];
    mo = z[1];
    for (k=2,length(z),  mo = lcm(mo,z[k]) );
    return( mo );
} /* ----------- */

\\ ==== end of file ====