fricas
p ==> 3
Type: Void
fricas
K ==> PrimeField p
Type: Void
fricas
P ==> UnivariatePolynomial('x, K)
Type: Void
fricas
x: P := monomial(1,1)$P
fricas
f: P := (x+2)*(2*x^5 + x^3 + 2)
fricas
g: P := 2*x^3 + x^2 -x +1
fricas
f/g
fricas
factor f
fricas
factor g
fricas
k: K := 2
fricas
f/k
In order to work with a finite field of order where is a prime, define
the second argument of UnivariatePolynomial as FiniteField?(p, n).
fricas
F ==> FiniteField(p, 2)
Type: Void
fricas
b: Vector F := basis()$F
Type: Vector(FiniteField
?(3,
2))
fricas
t: F := b.2
fricas
1+t+t^2+t^3
fricas
PF ==> UnivariatePolynomial('y, F)
Type: Void
fricas
y: PF := monomial(1,1)$PF
fricas
pf: PF := (y+2)*(2*y^5 + y^3 + 2)
fricas
pg: PF := (2*t+1)*y^3 + (1+t)*y^2 -t*y +1
fricas
pf/pg
fricas
factor pf
fricas
factor pg
In case the field property is not needed, IntegerMod? would be the way to go.
But note that in general there are zero divisors, so division will not work
(even not in the case where the argument of IntegerMod? is a prime).
The reason is IntegerMod? doesn't check whether it's argument is prime and so
does not know that it might be an integral domain.
fricas
R ==> IntegerMod(p)
Type: Void
fricas
PR ==> UnivariatePolynomial('z, R)
Type: Void
fricas
z: PR := monomial(1,1)$PR
fricas
rf: PR := (z+2)*(2*z^5 + z^3 + 2)
fricas
rg: PR := 2*z^3 + z^2 -z +1
fricas
rf/rg
There are 12 exposed and 12 unexposed library operations named /
having 2 argument(s) but none was determined to be applicable.
Use HyperDoc Browse, or issue
)display op /
to learn more about the available operations. Perhaps
package-calling the operation or using coercions on the arguments
will allow you to apply the operation.
Cannot find a definition or applicable library operation named /
with argument type(s)
UnivariatePolynomial(z,IntegerMod(3))
UnivariatePolynomial(z,IntegerMod(3))
Perhaps you should use "@" to indicate the required return type,
or "$" to specify which version of the function you need.
F has IntegralDomain
Type: Boolean
fricas
factor rf
fricas
factor rg
Also note that factorization of rf fails.
The reason most probably is that the used algorithm needs to divide
by some coefficient and it fails to recognize that this is in fact possible
(at least for primes p). In IntegerMod?, there simply is no division.
fricas
r1: R := 2
fricas
r2: R := 1
fricas
r1/r2
There are 12 exposed and 12 unexposed library operations named /
having 2 argument(s) but none was determined to be applicable.
Use HyperDoc Browse, or issue
)display op /
to learn more about the available operations. Perhaps
package-calling the operation or using coercions on the arguments
will allow you to apply the operation.
Cannot find a definition or applicable library operation named /
with argument type(s)
IntegerMod(3)
IntegerMod(3)
Perhaps you should use "@" to indicate the required return type,
or "$" to specify which version of the function you need.
r2/r1
There are 12 exposed and 12 unexposed library operations named /
having 2 argument(s) but none was determined to be applicable.
Use HyperDoc Browse, or issue
)display op /
to learn more about the available operations. Perhaps
package-calling the operation or using coercions on the arguments
will allow you to apply the operation.
Cannot find a definition or applicable library operation named /
with argument type(s)
IntegerMod(3)
IntegerMod(3)
Perhaps you should use "@" to indicate the required return type,
or "$" to specify which version of the function you need.