def _test(self):
from sage.all import GF, PolynomialRing, proof
k = GF(4, 'u')
u = k.gen()
R = PolynomialRing(k, 'v')
v = R.gen()
l = R.quo(v**3 + v + 1)
v = l.gen()
R = PolynomialRing(l, 'x,y')
x, y = R.gens()
f = y**3 + x**3 + (u + 1) * x
with proof.WithProof('polynomial', False):
f.factor()
def _test(self):
from sage.all import QQ, PolynomialRing
R = PolynomialRing(QQ, 'x')
x = R.gen()
if R.quo(x) is not R.quo(x):
raise Exception("#22983 has not been fixed")
