DeRhamComputation/superelliptic/tests/pth_root_test.sage

11 lines
225 B
Python

p = 3
m = 4
F = GF(p)
Rx.<x> = PolynomialRing(F)
f = x^5 + x
C = superelliptic(f, m)
g = (C.x)^5 * (C.y)^2 + 2*(C.x)^2 * (C.y)^3
g = g^p
print(g.pth_root()==(C.x)^5 * (C.y)^2 + 2*(C.x)^2 * (C.y)^3)
g = C.x
print(g.pth_root())