|
|
PROG
| (PARI) piptopipm1(n) = { local(x, y); for(x=1, n, y=pip(x)^pip(x)-1; print1(bdiv(y)", "); ) } pip = { return(prime(prime(n))) } bdiv(n) = \ The largest prime divisor of n { local(x); x=ifactor(n); return(x[length(x)]) } ifactor(n, m=0) = \The vector of the integer factors of n with multiplicity. { local(f, j, k, flist); flist=[]; f=Vec(factor(n, m)); for(j=1, length(f[1]), for(k = 1, f[2][j], flist = concat(flist, f[1][j]) ); ); return(flist) }
|
