| Home | Trees | Indices | Help |
|---|
|
|
File: sage/rings/polynomial/polynomial_element.pyx (starting at line 1)
Univariate Polynomial Base Class
AUTHORS:
-- William Stein: first version
-- Martin Albrecht: Added singular coercion.
-- Robert Bradshaw: Move Polynomial_generic_dense to SageX
TESTS:
sage: R.<x> = ZZ[]
sage: f = x^5 + 2*x^2 + (-1)
sage: f == loads(dumps(f))
True
|
|||
|
Polynomial File: sage/rings/polynomial/polynomial_element.pyx (starting at line 134) A polynomial. |
|||
|
Polynomial_generic_dense File: sage/rings/polynomial/polynomial_element.pyx (starting at line 3967) A generic dense polynomial. |
|||
|
|||
|
|||
|
|||
|
|||
CC = Complex Field with 53 bits of precision
|
|||
CDF = Complex Double Field
|
|||
QQ = Rational Field
|
|||
RDF = Real Double Field
|
|||
RR = Real Field with 53 bits of precision
|
|||
ZZ =
|
|||
pari = Interface to the PARI C library
|
|||
singular_default = Singular
|
|||
|
|||
File: sage/rings/polynomial/polynomial_element.pyx (starting at line 70)
Return True if f is of type univariate polynomial.
INPUT:
f -- an object
EXAMPLES:
sage: R.<x> = ZZ[]
sage: is_Polynomial(x^3 + x + 1)
True
sage: S.<y> = R[]
sage: f = y^3 + x*y -3*x; f
y^3 + x*y - 3*x
sage: is_Polynomial(f)
True
However this function does not return True for genuine multivariate
polynomial type objects or symbolic polynomials, since those are not
of the same data type as univariate polynomials:
sage: R.<x,y> = QQ[]
sage: f = y^3 + x*y -3*x; f
y^3 + x*y - 3*x
sage: is_Polynomial(f)
False
sage: var('x,y')
(x, y)
sage: f = y^3 + x*y -3*x; f
y^3 + x*y - 3*x
sage: is_Polynomial(f)
False
|
|
|||
ZZ
|
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0beta1 on Thu Jul 17 04:23:28 2008 | http://epydoc.sourceforge.net |