Code: Select all
function InverseModPrimePower( R, a, prime_power, N )
ok, p, r := IsPrimePower(prime_power);
where in this case: R: Univariate Polynomial Ring in X over Integer Ring, a: X^3 + X^2 + X + 1, prime_power: X + 2, N: 11
Would someone please advise on how to evaluate if p is a prime power without the error?