gdZddlmZddlmZddlmZddlmZm Z ddl m Z ddl m Z ddlmZdd lmZdd lmZmZmZdd lmZmZdd lmZdd lmZeGddZdgZdS)z)Implementation of :class:`Domain` class. ) annotations)Any)AlgebraicNumber)Basicsympify)ordered) GROUND_TYPES) DomainElement)lex)UnificationFailedCoercionFailed DomainError) _unify_gens _not_a_coeff)public) is_sequencec2eZdZUdZdZded< dZded< dZded< dZ dZ dZ dZ dxZ Z dxZZdxZZdxZZdxZZdxZZdxZZdxZZdxZZdxZZdxZ Z!dxZ"Z#dZ$d Z%dZ&dZ'dZ(dZ) dZ*dZ+d ed <dZ,d ed <d Z-dZ.dZ/dZ0dZ1e2dZ3dZ4dZ5dZ6dhdZ7dZ8dZ9dZ:dZ;dZdZ?dZ@d ZAd!ZBd"ZCd#ZDd$ZEd%ZFd&ZGd'ZHd(ZId)ZJd*ZKd+ZLd,ZMd-ZNd.ZOdhd/ZPd0ZQd1ZRd2ZSd3ZTd4ZUd5ZVd6ZWeXd7d8ZYeXd7d9ZZd:Z[d;Z\dd<d=Z]did?Z^djdAZ_dBZ`dCZadDZbdEZcdFZddGZedHZfdIZgdJZhdKZidLZjdMZkdNZldOZmdPZndQZodRZpdSZqdTZrdUZsdVZtdWZudXZvdYZwdZZxd[Zyd\Zzd]Z{d^Z|d_Z}d`Z~daZdbZdhdcZeZddZdeZdhdfZdgZdS)kDomainaySuperclass for all domains in the polys domains system. See :ref:`polys-domainsintro` for an introductory explanation of the domains system. The :py:class:`~.Domain` class is an abstract base class for all of the concrete domain types. There are many different :py:class:`~.Domain` subclasses each of which has an associated ``dtype`` which is a class representing the elements of the domain. The coefficients of a :py:class:`~.Poly` are elements of a domain which must be a subclass of :py:class:`~.Domain`. Examples ======== The most common example domains are the integers :ref:`ZZ` and the rationals :ref:`QQ`. >>> from sympy import Poly, symbols, Domain >>> x, y = symbols('x, y') >>> p = Poly(x**2 + y) >>> p Poly(x**2 + y, x, y, domain='ZZ') >>> p.domain ZZ >>> isinstance(p.domain, Domain) True >>> Poly(x**2 + y/2) Poly(x**2 + 1/2*y, x, y, domain='QQ') The domains can be used directly in which case the domain object e.g. (:ref:`ZZ` or :ref:`QQ`) can be used as a constructor for elements of ``dtype``. >>> from sympy import ZZ, QQ >>> ZZ(2) 2 >>> ZZ.dtype # doctest: +SKIP >>> type(ZZ(2)) # doctest: +SKIP >>> QQ(1, 2) 1/2 >>> type(QQ(1, 2)) # doctest: +SKIP The corresponding domain elements can be used with the arithmetic operations ``+,-,*,**`` and depending on the domain some combination of ``/,//,%`` might be usable. For example in :ref:`ZZ` both ``//`` (floor division) and ``%`` (modulo division) can be used but ``/`` (true division) cannot. Since :ref:`QQ` is a :py:class:`~.Field` its elements can be used with ``/`` but ``//`` and ``%`` should not be used. Some domains have a :py:meth:`~.Domain.gcd` method. >>> ZZ(2) + ZZ(3) 5 >>> ZZ(5) // ZZ(2) 2 >>> ZZ(5) % ZZ(2) 1 >>> QQ(1, 2) / QQ(2, 3) 3/4 >>> ZZ.gcd(ZZ(4), ZZ(2)) 2 >>> QQ.gcd(QQ(2,7), QQ(5,3)) 1/21 >>> ZZ.is_Field False >>> QQ.is_Field True There are also many other domains including: 1. :ref:`GF(p)` for finite fields of prime order. 2. :ref:`RR` for real (floating point) numbers. 3. :ref:`CC` for complex (floating point) numbers. 4. :ref:`QQ(a)` for algebraic number fields. 5. :ref:`K[x]` for polynomial rings. 6. :ref:`K(x)` for rational function fields. 7. :ref:`EX` for arbitrary expressions. Each domain is represented by a domain object and also an implementation class (``dtype``) for the elements of the domain. For example the :ref:`K[x]` domains are represented by a domain object which is an instance of :py:class:`~.PolynomialRing` and the elements are always instances of :py:class:`~.PolyElement`. The implementation class represents particular types of mathematical expressions in a way that is more efficient than a normal SymPy expression which is of type :py:class:`~.Expr`. The domain methods :py:meth:`~.Domain.from_sympy` and :py:meth:`~.Domain.to_sympy` are used to convert from :py:class:`~.Expr` to a domain element and vice versa. >>> from sympy import Symbol, ZZ, Expr >>> x = Symbol('x') >>> K = ZZ[x] # polynomial ring domain >>> K ZZ[x] >>> type(K) # class of the domain >>> K.dtype # class of the elements >>> p_expr = x**2 + 1 # Expr >>> p_expr x**2 + 1 >>> type(p_expr) >>> isinstance(p_expr, Expr) True >>> p_domain = K.from_sympy(p_expr) >>> p_domain # domain element x**2 + 1 >>> type(p_domain) >>> K.to_sympy(p_domain) == p_expr True The :py:meth:`~.Domain.convert_from` method is used to convert domain elements from one domain to another. >>> from sympy import ZZ, QQ >>> ez = ZZ(2) >>> eq = QQ.convert_from(ez, ZZ) >>> type(ez) # doctest: +SKIP >>> type(eq) # doctest: +SKIP Elements from different domains should not be mixed in arithmetic or other operations: they should be converted to a common domain first. The domain method :py:meth:`~.Domain.unify` is used to find a domain that can represent all the elements of two given domains. >>> from sympy import ZZ, QQ, symbols >>> x, y = symbols('x, y') >>> ZZ.unify(QQ) QQ >>> ZZ[x].unify(QQ) QQ[x] >>> ZZ[x].unify(QQ[y]) QQ[x,y] If a domain is a :py:class:`~.Ring` then is might have an associated :py:class:`~.Field` and vice versa. The :py:meth:`~.Domain.get_field` and :py:meth:`~.Domain.get_ring` methods will find or create the associated domain. >>> from sympy import ZZ, QQ, Symbol >>> x = Symbol('x') >>> ZZ.has_assoc_Field True >>> ZZ.get_field() QQ >>> QQ.has_assoc_Ring True >>> QQ.get_ring() ZZ >>> K = QQ[x] >>> K QQ[x] >>> K.get_field() QQ(x) See also ======== DomainElement: abstract base class for domain elements construct_domain: construct a minimal domain for some expressions Nz type | NonedtyperzerooneFTz str | NonerepaliasctNNotImplementedErrorselfs V/var/www/html/ai-engine/env/lib/python3.11/site-packages/sympy/polys/domains/domain.py__init__zDomain.__init__gs!!c|jSr)rrs r __str__zDomain.__str__js xr"c t|Sr)strrs r __repr__zDomain.__repr__ms4yyr"cBt|jj|jfSr)hash __class____name__rrs r __hash__zDomain.__hash__psT^,dj9:::r"c|j|Srrrargss r newz Domain.newstz4  r"c|jS)z#Alias for :py:attr:`~.Domain.dtype`r.rs r tpz Domain.tpvs zr"c|j|S)z7Construct an element of ``self`` domain from ``args``. )r1r/s r __call__zDomain.__call__{stxr"c|j|Srr.r/s r normalz Domain.normalr2r"c |j d|jz}nd|jjz}t||}||||}||St d|dt |d|d|)z=Convert ``element`` to ``self.dtype`` given the base domain. Nfrom_Cannot convert of type z from  to )rr*r+getattrr type)relementbasemethod_convertresults r convert_fromzDomain.convert_froms : !tz)FFt~66F4((  Xgt,,F! nWWWVZ[bVcVcVcVceieieikokopqqqr"c|7t|rtd|z|||S||r|St|rtd|zddlm}m}m}m}||r|||St|tr||||StdkrVt||j r|||St||j r|||St|tr+|d}||||St|tr+|d}||||St|tr(|||S|jr8t%|ddr'||St|t*r- ||S#t.t0f$rYngwxYwt3|sT t5|d }t|t*r||Sn#t.t0f$rYnwxYwtd |d t7|d |)z'Convert ``element`` to ``self.dtype``. Nz%s is not in any domainr)ZZQQ RealField ComplexFieldpythonF)tol is_groundT)strictr;r<r=)rr rEof_typesympy.polys.domainsrGrHrIrJ isinstanceintr r4floatcomplexr parent is_Numericalr>convertLCr from_sympy TypeError ValueErrorrrr?)rr@rArGrHrIrJrUs r rWzDomain.convertsB  G$$ J$%>%HIII$$Wd33 3 <<  N   F !:W!DEE EGGGGGGGGGGGG ::g   2$$Wb11 1 gs # # 6$$RR[["55 5 8 # #'25)) 6(("555'25)) 6(("555 gu % % >Y5)))F$$VVG__f== = gw ' ' >!\e,,,F$$VVG__f== = g} - - @$$Wgnn.>.>?? ?   .+u!E!E .<< -- - gu % %  w///z*    w'' %gd;;;G!'5118#w7778!:.DnWWWdSZmmmm]a]abcccs$I%%I98I9 :KKKc,t||jS)z%Check if ``a`` is of type ``dtype``. )rQr4)rr@s r rOzDomain.of_types'47+++r"c t|rt||n#t$rYdSwxYwdS)z'Check if ``a`` belongs to this domain. FT)rr rWras r __contains__zDomain.__contains__sU A %$$ LLOOOO   55 ts +. <<ct)a Convert domain element *a* to a SymPy expression (Expr). Explanation =========== Convert a :py:class:`~.Domain` element *a* to :py:class:`~.Expr`. Most public SymPy functions work with objects of type :py:class:`~.Expr`. The elements of a :py:class:`~.Domain` have a different internal representation. It is not possible to mix domain elements with :py:class:`~.Expr` so each domain has :py:meth:`~.Domain.to_sympy` and :py:meth:`~.Domain.from_sympy` methods to convert its domain elements to and from :py:class:`~.Expr`. Parameters ========== a: domain element An element of this :py:class:`~.Domain`. Returns ======= expr: Expr A normal SymPy expression of type :py:class:`~.Expr`. Examples ======== Construct an element of the :ref:`QQ` domain and then convert it to :py:class:`~.Expr`. >>> from sympy import QQ, Expr >>> q_domain = QQ(2) >>> q_domain 2 >>> q_expr = QQ.to_sympy(q_domain) >>> q_expr 2 Although the printed forms look similar these objects are not of the same type. >>> isinstance(q_domain, Expr) False >>> isinstance(q_expr, Expr) True Construct an element of :ref:`K[x]` and convert to :py:class:`~.Expr`. >>> from sympy import Symbol >>> x = Symbol('x') >>> K = QQ[x] >>> x_domain = K.gens[0] # generator x as a domain element >>> p_domain = x_domain**2/3 + 1 >>> p_domain 1/3*x**2 + 1 >>> p_expr = K.to_sympy(p_domain) >>> p_expr x**2/3 + 1 The :py:meth:`~.Domain.from_sympy` method is used for the opposite conversion from a normal SymPy expression to a domain element. >>> p_domain == p_expr False >>> K.from_sympy(p_expr) == p_domain True >>> K.to_sympy(p_domain) == p_expr True >>> K.from_sympy(K.to_sympy(p_domain)) == p_domain True >>> K.to_sympy(K.from_sympy(p_expr)) == p_expr True The :py:meth:`~.Domain.from_sympy` method makes it easier to construct domain elements interactively. >>> from sympy import Symbol >>> x = Symbol('x') >>> K = QQ[x] >>> K.from_sympy(x**2/3 + 1) 1/3*x**2 + 1 See also ======== from_sympy convert_from rr^s r to_sympyzDomain.to_sympys v"!r"ct)aConvert a SymPy expression to an element of this domain. Explanation =========== See :py:meth:`~.Domain.to_sympy` for explanation and examples. Parameters ========== expr: Expr A normal SymPy expression of type :py:class:`~.Expr`. Returns ======= a: domain element An element of this :py:class:`~.Domain`. See also ======== to_sympy convert_from rr^s r rYzDomain.from_sympy:s 4"!r"c.t||jS)N)start)sumrr/s r rfz Domain.sumVs4ty))))r"cdSz.Convert ``ModularInteger(int)`` to ``dtype``. NK1r_K0s r from_FFzDomain.from_FFYtr"cdSrhrirjs r from_FF_pythonzDomain.from_FF_python]rnr"cdS)z.Convert a Python ``int`` object to ``dtype``. Nrirjs r from_ZZ_pythonzDomain.from_ZZ_pythonarnr"cdS)z3Convert a Python ``Fraction`` object to ``dtype``. Nrirjs r from_QQ_pythonzDomain.from_QQ_pythonernr"cdS)z.Convert ``ModularInteger(mpz)`` to ``dtype``. Nrirjs r from_FF_gmpyzDomain.from_FF_gmpyirnr"cdS)z,Convert a GMPY ``mpz`` object to ``dtype``. Nrirjs r from_ZZ_gmpyzDomain.from_ZZ_gmpymrnr"cdS)z,Convert a GMPY ``mpq`` object to ``dtype``. Nrirjs r from_QQ_gmpyzDomain.from_QQ_gmpyqrnr"cdS)z,Convert a real element object to ``dtype``. Nrirjs r from_RealFieldzDomain.from_RealFieldurnr"cdS)z(Convert a complex element to ``dtype``. Nrirjs r from_ComplexFieldzDomain.from_ComplexFieldyrnr"cdS)z*Convert an algebraic number to ``dtype``. Nrirjs r from_AlgebraicFieldzDomain.from_AlgebraicField}rnr"cT|jr ||j|jSdS)#Convert a polynomial to ``dtype``. N)rMrWrXdomrjs r from_PolynomialRingzDomain.from_PolynomialRings. ; ,::adBF++ + , ,r"cdS)z*Convert a rational function to ``dtype``. Nrirjs r from_FractionFieldzDomain.from_FractionFieldrnr"cB||j|jS)z.Convert an ``ExtensionElement`` to ``dtype``. )rErringrjs r from_MonogenicFiniteExtensionz$Domain.from_MonogenicFiniteExtensionsqubg...r"c6||jSz&Convert a ``EX`` object to ``dtype``. )rYexrjs r from_ExpressionDomainzDomain.from_ExpressionDomains}}QT"""r"c,||Sr)rYrjs r from_ExpressionRawDomainzDomain.from_ExpressionRawDomains}}Qr"c|dkr-|||jSdS)rrN)degreerWrXrrjs r from_GlobalPolynomialRingz Domain.from_GlobalPolynomialRings8 88::??::addffbf-- - ?r"c.|||Sr)rrjs r from_GeneralizedPolynomialRingz%Domain.from_GeneralizedPolynomialRings$$Q+++r"c $|jr$t|jt|zs+|jrJt|jt|zr&td|d|dt |d||S)N Cannot unify  with z, given z generators) is_Compositesetsymbolsr tupleunify)rlrkrs r unify_with_symbolszDomain.unify_with_symbolss O oRZ3w< 'DJO '& '__&&F ? BO r7J bNb ,CC,C POOOOO & & &3vw'' 's67E***r"cX||||S||kr|S|jr|jsT||krtd|d|||S|jr|S|jr|S|jr|S|jr|S|js|jr|jr||}}|jrPtt|j |j gd|j kr||}}| |S| |j }|j|}| |S|js|jr||Sd}|jr||}}|jr"|js|jr||j||S|S|jr||}}|jrF|jr||j||S|js|jrddlm}||j|jS|S|jr||}}|jr|jr|}|jr|}|jrC|j|j|jgt=|j|jRS|S|jr|S|jr|S|jr|j r|}|S|jr|j r|}|S|j r|S|j r|S|j!r|S|j!r|Sdd l"m#}|S) aZ Construct a minimal domain that contains elements of ``K0`` and ``K1``. Known domains (from smallest to largest): - ``GF(p)`` - ``ZZ`` - ``QQ`` - ``RR(prec, tol)`` - ``CC(prec, tol)`` - ``ALG(a, b, c)`` - ``K[x, y, z]`` - ``K(x, y, z)`` - ``EX`` Nrrct|j|j}t|j|j}|||S)NprecrL)max precision tolerance)rrlrkrrLs r mkinexactzDomain.unify..mkinexacts=r|R\22DblBL11C3Dc*** *r"r)rJr)EX)$rhas_CharacteristicZerocharacteristicr ris_EXRAWis_EXis_FiniteExtensionlistrmodulus set_domaindropsymbolrrris_ComplexField is_RealFieldr*is_GaussianRingis_GaussianField sympy.polys.domains.complexfieldrJrris_AlgebraicField get_fieldas_AlgebraicFieldrrorig_extis_RationalFieldis_IntegerRingrPr)rlrkrrrJrs r rz Domain.unifys"  ((W55 5 88I) *b.G *  ""b&7&7&9&999''RRR(LMMM %%b)) ) ; I ; I 8 I 8 I )B$9 )$ RB$ )RZ 899::1=KKB}}R(((WWRY''Y__R((}}R((( ? *bo *%%b)) ) + + +   B  ! R_  yr2666 ? B ?   yr2666# r': IIIIII#|2<HHHH  B  ! $\\^^" ,))++# #r|BFLL$8$8a;r{TVT_;`;`aaaa  I  I  " $\\^^I  " $\\^^I  I  I  I  I****** r"cLt|to|j|jkS)z0Returns ``True`` if two domains are equivalent. )rQrrrothers r __eq__z Domain.__eq__Ds"%((FTZ5;-FFr"c||k S)z1Returns ``False`` if two domains are equivalent. rirs r __ne__z Domain.__ne__Is5=  r"cg}|D]^}t|tr)|||@|||_|S)z5Rersively apply ``self`` to all elements of ``seq``. )rQrappendmap)rseqrDelts r rz Domain.mapMsi ) )C#t$$ ) dhhsmm,,,, dd3ii(((( r"c&td|z)z)Returns a ring associated with ``self``. z#there is no ring associated with %srrs r rzDomain.get_ringYs?$FGGGr"c&td|z)z*Returns a field associated with ``self``. z$there is no field associated with %srrs r rzDomain.get_field]s@4GHHHr"c|S)z2Returns an exact domain associated with ``self``. rirs r get_exactzDomain.get_exactas r"c`t|dr |j|S||S)z0The mathematical way to make a polynomial ring. __iter__)hasattr poly_ringrrs r __getitem__zDomain.__getitem__es5 7J ' ' +!4>7+ +>>'** *r")rc(ddlm}||||Sz(Returns a polynomial ring, i.e. `K[X]`. r)PolynomialRing)"sympy.polys.domains.polynomialringr)rrrrs r rzDomain.poly_ringls(EEEEEE~dGU333r"c(ddlm}||||Sz'Returns a fraction field, i.e. `K(X)`. r) FractionField)!sympy.polys.domains.fractionfieldr)rrrrs r frac_fieldzDomain.frac_fieldqs(CCCCCC}T7E222r"c&ddlm}||g|Ri|Sr)rr)rrkwargsrs r old_poly_ringzDomain.old_poly_ringvs4IIIIII~d7W777777r"c&ddlm}||g|Ri|Sr)%sympy.polys.domains.old_fractionfieldr)rrrrs r old_frac_fieldzDomain.old_frac_field{s4GGGGGG}T6G666v666r"rc&td|z)z6Returns an algebraic field, i.e. `K(\alpha, \ldots)`. z%Cannot create algebraic field over %sr)rr extensions r algebraic_fieldzDomain.algebraic_fieldsADHIIIr"cvddlm}|||}t||}|||S)a Convenience method to construct an algebraic extension on a root of a polynomial, chosen by root index. Parameters ========== poly : :py:class:`~.Poly` The polynomial whose root generates the extension. alias : str, optional (default=None) Symbol name for the generator of the extension. E.g. "alpha" or "theta". root_index : int, optional (default=-1) Specifies which root of the polynomial is desired. The ordering is as defined by the :py:class:`~.ComplexRootOf` class. The default of ``-1`` selects the most natural choice in the common cases of quadratic and cyclotomic fields (the square root on the positive real or imaginary axis, resp. $\mathrm{e}^{2\pi i/n}$). Examples ======== >>> from sympy import QQ, Poly >>> from sympy.abc import x >>> f = Poly(x**2 - 2) >>> K = QQ.alg_field_from_poly(f) >>> K.ext.minpoly == f True >>> g = Poly(8*x**3 - 6*x - 1) >>> L = QQ.alg_field_from_poly(g, "alpha") >>> L.ext.minpoly == g True >>> L.to_sympy(L([1, 1, 1])) alpha**2 + alpha + 1 r)CRootOfr)sympy.polys.rootoftoolsrrr)rpolyr root_indexrrootalphas r alg_field_from_polyzDomain.alg_field_from_polysSJ 433333wtZ((E222##E#777r"zetaczddlm}|r|t|z }||||||S)a Convenience method to construct a cyclotomic field. Parameters ========== n : int Construct the nth cyclotomic field. ss : boolean, optional (default=False) If True, append *n* as a subscript on the alias string. alias : str, optional (default="zeta") Symbol name for the generator. gen : :py:class:`~.Symbol`, optional (default=None) Desired variable for the cyclotomic polynomial that defines the field. If ``None``, a dummy variable will be used. root_index : int, optional (default=-1) Specifies which root of the polynomial is desired. The ordering is as defined by the :py:class:`~.ComplexRootOf` class. The default of ``-1`` selects the root $\mathrm{e}^{2\pi i/n}$. Examples ======== >>> from sympy import QQ, latex >>> K = QQ.cyclotomic_field(5) >>> K.to_sympy(K([-1, 1])) 1 - zeta >>> L = QQ.cyclotomic_field(7, True) >>> a = L.to_sympy(L([-1, 1])) >>> print(a) 1 - zeta7 >>> print(latex(a)) 1 - \zeta_{7} r)cyclotomic_poly)rr)sympy.polys.specialpolysrr&r)rnssrgenrrs r cyclotomic_fieldzDomain.cyclotomic_fields^H =<<<<<   SVVOE''3(?(?u3=(?? ?r"ct)z$Inject generators into this domain. rrs r injectz Domain.inject!!r"c"|jr|St)z"Drop generators from this domain. ) is_Simplerrs r rz Domain.drops > K!!r"c| S)zReturns True if ``a`` is zero. rir^s r is_zerozDomain.is_zeros u r"c||jkS)zReturns True if ``a`` is one. )rr^s r is_onez Domain.is_onesDH}r"c|dkS)z#Returns True if ``a`` is positive. rrir^s r is_positivezDomain.is_positive 1u r"c|dkS)z#Returns True if ``a`` is negative. rrir^s r is_negativezDomain.is_negativerr"c|dkS)z'Returns True if ``a`` is non-positive. rrir^s r is_nonpositivezDomain.is_nonpositive Av r"c|dkS)z'Returns True if ``a`` is non-negative. rrir^s r is_nonnegativezDomain.is_nonnegativerr"cJ||r|j S|jSr)rrr^s r canonical_unitzDomain.canonical_units)   A   H9 8Or"c t|S)z.Absolute value of ``a``, implies ``__abs__``. )absr^s r rz Domain.abss 1vv r"c| S)z,Returns ``a`` negated, implies ``__neg__``. rir^s r negz Domain.neg r r"c| S)z-Returns ``a`` positive, implies ``__pos__``. rir^s r posz Domain.posr r"c ||zS)z.Sum of ``a`` and ``b``, implies ``__add__``. rirr_bs r addz Domain.add  1u r"c ||z S)z5Difference of ``a`` and ``b``, implies ``__sub__``. rir$s r subz Domain.subr'r"c ||zS)z2Product of ``a`` and ``b``, implies ``__mul__``. rir$s r mulz Domain.mulr'r"c ||zS)z2Raise ``a`` to power ``b``, implies ``__pow__``. rir$s r powz Domain.pows Av r"ct)a Exact quotient of *a* and *b*. Analogue of ``a / b``. Explanation =========== This is essentially the same as ``a / b`` except that an error will be raised if the division is inexact (if there is any remainder) and the result will always be a domain element. When working in a :py:class:`~.Domain` that is not a :py:class:`~.Field` (e.g. :ref:`ZZ` or :ref:`K[x]`) ``exquo`` should be used instead of ``/``. The key invariant is that if ``q = K.exquo(a, b)`` (and ``exquo`` does not raise an exception) then ``a == b*q``. Examples ======== We can use ``K.exquo`` instead of ``/`` for exact division. >>> from sympy import ZZ >>> ZZ.exquo(ZZ(4), ZZ(2)) 2 >>> ZZ.exquo(ZZ(5), ZZ(2)) Traceback (most recent call last): ... ExactQuotientFailed: 2 does not divide 5 in ZZ Over a :py:class:`~.Field` such as :ref:`QQ`, division (with nonzero divisor) is always exact so in that case ``/`` can be used instead of :py:meth:`~.Domain.exquo`. >>> from sympy import QQ >>> QQ.exquo(QQ(5), QQ(2)) 5/2 >>> QQ(5) / QQ(2) 5/2 Parameters ========== a: domain element The dividend b: domain element The divisor Returns ======= q: domain element The exact quotient Raises ====== ExactQuotientFailed: if exact division is not possible. ZeroDivisionError: when the divisor is zero. See also ======== quo: Analogue of ``a // b`` rem: Analogue of ``a % b`` div: Analogue of ``divmod(a, b)`` Notes ===== Since the default :py:attr:`~.Domain.dtype` for :ref:`ZZ` is ``int`` (or ``mpz``) division as ``a / b`` should not be used as it would give a ``float`` which is not a domain element. >>> ZZ(4) / ZZ(2) # doctest: +SKIP 2.0 >>> ZZ(5) / ZZ(2) # doctest: +SKIP 2.5 On the other hand with `SYMPY_GROUND_TYPES=flint` elements of :ref:`ZZ` are ``flint.fmpz`` and division would raise an exception: >>> ZZ(4) / ZZ(2) # doctest: +SKIP Traceback (most recent call last): ... TypeError: unsupported operand type(s) for /: 'fmpz' and 'fmpz' Using ``/`` with :ref:`ZZ` will lead to incorrect results so :py:meth:`~.Domain.exquo` should be used instead. rr$s r exquoz Domain.exquos r"!r"ct)aGQuotient of *a* and *b*. Analogue of ``a // b``. ``K.quo(a, b)`` is equivalent to ``K.div(a, b)[0]``. See :py:meth:`~.Domain.div` for more explanation. See also ======== rem: Analogue of ``a % b`` div: Analogue of ``divmod(a, b)`` exquo: Analogue of ``a / b`` rr$s r quoz Domain.quow "!r"ct)aNModulo division of *a* and *b*. Analogue of ``a % b``. ``K.rem(a, b)`` is equivalent to ``K.div(a, b)[1]``. See :py:meth:`~.Domain.div` for more explanation. See also ======== quo: Analogue of ``a // b`` div: Analogue of ``divmod(a, b)`` exquo: Analogue of ``a / b`` rr$s r remz Domain.remr2r"ct)a[ Quotient and remainder for *a* and *b*. Analogue of ``divmod(a, b)`` Explanation =========== This is essentially the same as ``divmod(a, b)`` except that is more consistent when working over some :py:class:`~.Field` domains such as :ref:`QQ`. When working over an arbitrary :py:class:`~.Domain` the :py:meth:`~.Domain.div` method should be used instead of ``divmod``. The key invariant is that if ``q, r = K.div(a, b)`` then ``a == b*q + r``. The result of ``K.div(a, b)`` is the same as the tuple ``(K.quo(a, b), K.rem(a, b))`` except that if both quotient and remainder are needed then it is more efficient to use :py:meth:`~.Domain.div`. Examples ======== We can use ``K.div`` instead of ``divmod`` for floor division and remainder. >>> from sympy import ZZ, QQ >>> ZZ.div(ZZ(5), ZZ(2)) (2, 1) If ``K`` is a :py:class:`~.Field` then the division is always exact with a remainder of :py:attr:`~.Domain.zero`. >>> QQ.div(QQ(5), QQ(2)) (5/2, 0) Parameters ========== a: domain element The dividend b: domain element The divisor Returns ======= (q, r): tuple of domain elements The quotient and remainder Raises ====== ZeroDivisionError: when the divisor is zero. See also ======== quo: Analogue of ``a // b`` rem: Analogue of ``a % b`` exquo: Analogue of ``a / b`` Notes ===== If ``gmpy`` is installed then the ``gmpy.mpq`` type will be used as the :py:attr:`~.Domain.dtype` for :ref:`QQ`. The ``gmpy.mpq`` type defines ``divmod`` in a way that is undesirable so :py:meth:`~.Domain.div` should be used instead of ``divmod``. >>> a = QQ(1) >>> b = QQ(3, 2) >>> a # doctest: +SKIP mpq(1,1) >>> b # doctest: +SKIP mpq(3,2) >>> divmod(a, b) # doctest: +SKIP (mpz(0), mpq(1,1)) >>> QQ.div(a, b) # doctest: +SKIP (mpq(2,3), mpq(0,1)) Using ``//`` or ``%`` with :ref:`QQ` will lead to incorrect results so :py:meth:`~.Domain.div` should be used instead. rr$s r divz Domain.divs h"!r"ct)z5Returns inversion of ``a mod b``, implies something. rr$s r invertz Domain.invertr r"ct)z!Returns ``a**(-1)`` if possible. rr^s r revertz Domain.revertr r"ct)zReturns numerator of ``a``. rr^s r numerz Domain.numerr r"ct)zReturns denominator of ``a``. rr^s r denomz Domain.denomr r"c>|||\}}}||fS)z&Half extended GCD of ``a`` and ``b``. )gcdex)rr_r%sths r half_gcdexzDomain.half_gcdexs$**Q""1a!t r"ct)z!Extended GCD of ``a`` and ``b``. rr$s r r@z Domain.gcdexr r"c|||}|||}|||}|||fS)z.Returns GCD and cofactors of ``a`` and ``b``. )gcdr1)rr_r%rGcfacfbs r cofactorszDomain.cofactorssEhhq!nnhhq#hhq#C}r"ct)z Returns GCD of ``a`` and ``b``. rr$s r rGz Domain.gcd r r"ct)z Returns LCM of ``a`` and ``b``. rr$s r lcmz Domain.lcmr r"ct)z#Returns b-base logarithm of ``a``. rr$s r logz Domain.logr r"ct)aJReturns a (possibly inexact) square root of ``a``. Explanation =========== There is no universal definition of "inexact square root" for all domains. It is not recommended to implement this method for domains other then :ref:`ZZ`. See also ======== exsqrt rr^s r sqrtz Domain.sqrtr2r"ct)aReturns whether ``a`` is a square in the domain. Explanation =========== Returns ``True`` if there is an element ``b`` in the domain such that ``b * b == a``, otherwise returns ``False``. For inexact domains like :ref:`RR` and :ref:`CC`, a tiny difference in this equality can be tolerated. See also ======== exsqrt rr^s r is_squarezDomain.is_square&s "!r"ct)a'Principal square root of a within the domain if ``a`` is square. Explanation =========== The implementation of this method should return an element ``b`` in the domain such that ``b * b == a``, or ``None`` if there is no such ``b``. For inexact domains like :ref:`RR` and :ref:`CC`, a tiny difference in this equality can be tolerated. The choice of a "principal" square root should follow a consistent rule whenever possible. See also ======== sqrt, is_square rr^s r exsqrtz Domain.exsqrt6s "!r"c D||j|fi|S)z*Returns numerical approximation of ``a``. )rbevalf)rr_roptionss r rWz Domain.evalfGs)%t}}Q%d66g666r"c|Srrir^s r realz Domain.realMsr"c|jSr)rr^s r imagz Domain.imagPs yr"c||kS)z+Check if ``a`` and ``b`` are almost equal. ri)rr_r%rs r almosteqzDomain.almosteqSrr"c td)z*Return the characteristic of this domain. zcharacteristic()rrs r rzDomain.characteristicWs!"4555r"r)Nr)FrNr)r+ __module__ __qualname____doc__r__annotations__rris_Ringrrhas_assoc_Fieldis_FiniteFieldis_FFris_ZZris_QQris_ZZ_Iris_QQ_Iris_RRris_CCr is_Algebraicris_Polyris_Fracis_SymbolicDomainris_SymbolicRawDomainrris_ExactrVr ris_PIDrrrr!r$r'r,r1propertyr4r6r8rErWrOr`rbrYrfrmrprrrtrvrxrzr|r~rrrrrrrrrrrrrrrrrrr rrrrrrrrrr rrrrrrrrr"r&r)r+r-r/r1r4r6r8r:r<r>rDr@rJrGrMrOrQrSrUrWrrZr\r^rrir"r rrshhTE,D COOOO G$H"N O #"NU""NU$$u %%Og!&&w  L5##Oe',, "''!&&w %%&++8HLIL F"#CE""";;;!!!X!!!rrr"9d9d9d9dv,,,   ["["["z"""8***,,, ///###   ... ,,, +++B}}}}~GGG !!!   HHHIII+++),44444 *-33333 888 777 15JJJJJ(8(8(8(8T(?(?(?(?T""""""  Y"Y"Y"v " " " " " "T"T"T"l"""""""""""" """""""""""" " " """" """"7777 A66666r"rN)rb __future__rtypingrsympy.core.numbersr sympy.corerrsympy.core.sortingrsympy.external.gmpyr !sympy.polys.domains.domainelementr sympy.polys.orderingsr sympy.polys.polyerrorsr r rsympy.polys.polyutilsrrsympy.utilitiesrsympy.utilities.iterablesrr__all__rir"r rsE//""""""......%%%%%%%%&&&&&&,,,,,,;;;;;;%%%%%%QQQQQQQQQQ;;;;;;;;""""""111111F6F6F6F6F6F6F6F6R* *r"