p = randomprime(2^100)
a = Mod(2,p);
type(a)
a^(p-1)
a.mod == p
lift(a)

T = x^2+1;
b = Mod(x+a, T);
type(b)
b.pol
b.mod == T

c = ffgen(3^8,'c)
type(c)
c.p
c.mod
polisirreducible(c.mod*Mod(1,3))
c.f

d = c^9+1
d.pol
type(d.pol)
ffinit(3,5)
ffgen(x^2+Mod(1,3))

[c,c+1;2*c,1]^-1
d = random(c)
issquare(d)
trace(d)
norm(d)
minpoly(d^82)

factor(x^5+x^3+c)
polrootsmod(x^7+x+c)