+
    0åûj¿P  ã                   óP  € R t ^ RIHt ^ RIt^ RIHtHt ^ RIHt ^ RI	H
t
 ^ RIHt ^ RIHt ^ RIHt ^ R	IHtHt ^ R
IHtHtHtHt ^ RIHt ^ RIHtHtHtHt ^ RI H!t! ^ RI"H#t#  ! R R]4      t$RR lt%R t&RR lt'RR lt(RR lt)RR lt*RR lt+RR lt,]#RRR^RR/R l4       t-R# ) zà
Compute Galois groups of polynomials.

We use algorithms from [1], with some modifications to use lookup tables for
resolvents.

References
==========

.. [1] Cohen, H. *A Course in Computational Algebraic Number Theory*.

)ÚdefaultdictN)ÚDummyÚsymbols)Ú	is_square)ÚZZ)Ú
dup_random)Údup_eval)Údup_discriminant)Údup_factor_listÚdup_irreducible_p)ÚGaloisGroupExceptionÚget_resolvent_by_lookupÚdefine_resolventsÚ	Resolvent)Úcoeff_search)ÚPolyÚpoly_from_exprÚPolificationFailedÚComputationFailed)Ú	dup_sqf_p)Úpublicc                   ó   € ] tR t^#tRtR# )ÚMaxTriesException© N)Ú__name__Ú
__module__Ú__qualname__Ú__firstlineno__Ú__static_attributes__r   ó    ÚaC:\Ai_Coding\apps\studio\ComfyUI\.venv\Lib\site-packages\sympy\polys\numberfields\galoisgroups.pyr   r   #   s   † Ûr   r   c                óÀ  a€ \        R4      pV P                  4       pVf   \        4       pVP                  V P                  4       V'       d   / o^p^pV3R lp	\        V4       EFk  p
V'       d–   V	! X4      p\        V4      p\        R V 4       4      pW�,           X8”  d7   V^8X  d   V^,          pV^,
          pM	V^,          pV	! V4      p\        V4      p\        ^4      .V Uu. uF  p\        V4      NK  	  up,           pMK\        V
^,          ^,           V4      p\        P                  ! ^V^,
          4      p\        VV) V\        4      p\        WðP                  4      p\        V P                  VV,
          4      V4      pVP                  V9  g   EK7  \!        VP                  P#                  4       \        4      '       g   EKh  VV3u # 	  \$        hu upi )a…  
Given a univariate, monic, irreducible polynomial over the integers, find
another such polynomial defining the same number field.

Explanation
===========

See Alg 6.3.4 of [1].

Parameters
==========

T : Poly
    The given polynomial
max_coeff : int
    When choosing a transformation as part of the process,
    keep the coeffs between plus and minus this.
max_tries : int
    Consider at most this many transformations.
history : set, None, optional (default=None)
    Pass a set of ``Poly.rep``'s in order to prevent any of these
    polynomials from being returned as the polynomial ``U`` i.e. the
    transformation of the given polynomial *T*. The given poly *T* will
    automatically be added to this set, before we try to find a new one.
fixed_order : bool, default True
    If ``True``, work through candidate transformations A(x) in a fixed
    order, from small coeffs to large, resulting in deterministic behavior.
    If ``False``, the A(x) are chosen randomly, while still working our way
    up from small coefficients to larger ones.

Returns
=======

Pair ``(A, U)``

    ``A`` and ``U`` are ``Poly``, ``A`` is the
    transformation, and ``U`` is the transformed polynomial that defines
    the same number field as *T*. The polynomial ``A`` maps the roots of
    *T* to the roots of ``U``.

Raises
======

MaxTriesException
    if could not find a polynomial before exceeding *max_tries*.

ÚXc                 óJ   <€ SP                  V \        V ^4      4      pVSV &   V# )é   )Úgetr   )ÚdegreeÚgenÚcoeff_generatorss   & €r    Úget_coeff_generatorÚ9tschirnhausen_transformation.<locals>.get_coeff_generatorc   s,   ø€ Ø×"Ñ" 6¬<¸ÀÓ+BÓCˆØ#&Ð˜Ñ Øˆ
r   c              3   ó8   "  € T F  p\        V4      x € K  	  R # 5i)N)Úabs)Ú.0Úcs   & r    Ú	<genexpr>Ú/tschirnhausen_transformation.<locals>.<genexpr>x   s   é € Ð+¡F˜q”C˜—F�F£Fùs   ‚)r   r&   ÚsetÚaddÚrepÚrangeÚnextÚmaxr   ÚminÚrandomÚrandintr   r   r'   Ú	resultantr   Úto_listr   )ÚTÚ	max_coeffÚ	max_triesÚhistoryÚfixed_orderr"   ÚnÚdeg_coeff_sumÚcurrent_degreer)   Úir'   ÚcoeffsÚmr.   ÚaÚCÚdÚAÚUr(   s   &&&&&               @r    Útschirnhausen_transformationrL   '   sŒ  ø€ ôb 	ˆc‹
€AØ	�‰‹
€AØ‚Ü“%ˆØ‡K�K�—‘ÔçØÐØˆØˆõô
 �9×ˆ÷ ñ & nÓ5ˆCÜ˜#“YˆFÜÑ+¡FÓ+Ó+ˆAØÕ! MÔ1Ø! QÔ&Ø! QÕ&�MØ%2°QÕ%6‘Nà" aÕ'�NÙ)¨.Ó9�Ü˜c›�Ü�A“�©&Ó1©& Qœ2˜až5©&Ñ1Õ1‰Aô �A�q•D˜1•H˜iÓ(ˆAÜ—’˜q ! a¥%Ó(ˆAÜ˜1˜q˜b !¤RÓ(ˆAä�—E‘E‹NˆÜ�—‘˜Q �UÓ# QÓ'ˆØ�5‰5˜×¤I¨a¯e©e¯m©m«o¼r×$BÕ$BØ�a�4ŠKñM ôN Ðùò 2s   Ã(Gc                ó„   € \        V \        4      '       d   V P                  4       M\        V \        4      p\        V4      # )z?Convenience to check if a Poly or dup has square discriminant. )Ú
isinstancer   Údiscriminantr	   r   r   )r<   rI   s   & r    Úhas_square_discrP   ’   s.   € ä& q¬$×/Ò/ˆ�‰ÔÔ5EÀaÌÓ5L€AÜ�Q‹<Ðr   Fc                óh   € ^ RI Hp \        V 4      '       d   VP                  R3# VP                  R3# )zj
Compute the Galois group of a polynomial of degree 3.

Explanation
===========

Uses Prop 6.3.5 of [1].

)ÚS3TransitiveSubgroupsTF)Úsympy.combinatorics.galoisrR   rP   ÚA3ÚS3)r<   r>   Ú	randomizerR   s   &&& r    Ú_galois_group_degree_3rW   ˜   s9   € õ AÜ0?À×0BÒ0BÐ"×%Ñ% tÐ,ð 4Ø'×*Ñ*¨EÐ2ð4r   c           	     ó   € ^ RI Hp ^ RIHp \	        R4      pV^ ,          V^,          ,          V^,          V^,          ,          ,           pV! ^4      V! ^4      ! ^ ^4      V! ^4      ! ^ ^4      .p\        WeV4      pV^ ,          V^,          ^,          ,          V^,          V^,          ^,          ,          ,           V^,          V^,          ^,          ,          ,           V^,          V^ ,          ^,          ,          ,           p	V! ^4      V! ^4      ! ^ ^4      .p
\        4       p\        V4       EFQ  pV^ 8”  d   \        WVV'       * R7      w  rÐVP                  V RR7      w  ríp\        V\        4      '       g   KN  \        V 4      pVf)   V'       d   VP                  R3u # VP                  R3u # V'       d   VP                  R3u # W,          pV	P!                  \#        VV! V4      4      RR7      pV
 Uu. uF  pVV,          V,          NK  	  pp\        VVV4      pVP                  V 4      w  p p\%        V\        4      pV^ 8X  d   EK#  \'        V4      '       d   VP(                  R3u # VP*                  R3u # 	  \,        hu upi )	z–
Compute the Galois group of a polynomial of degree 4.

Explanation
===========

Follows Alg 6.3.7 of [1], using a pure root approximation approach.

©ÚPermutation©ÚS4TransitiveSubgroupszX0 X1 X2 X3©r>   r?   r@   T)Úfind_integer_rootF©Úsimultaneous)Ú sympy.combinatorics.permutationsrZ   rS   r\   r   r   r1   r4   rL   Úeval_for_polyr   r   rP   ÚA4ÚS4ÚVÚsubsÚzipr	   r   ÚC4ÚD4r   )r<   r>   rV   rZ   r\   r"   ÚF1Ús1ÚR1ÚF2_preÚs2_prer?   rD   Ú_ÚR_dupÚi0Úsq_discÚsigmaÚF2ÚtauÚs2ÚR2rI   s   &&&                    r    Ú"_galois_group_degree_4_root_approxrx   §   sP  € õ =Ý@ä�Ó€Að
 
ˆ1�ˆa��d��Q�q•T˜!˜A�$•YÕ	€Bá�A‹Ù�AŒ�q˜!ÓÙ�AŒ�q˜!Óð
€Bô
 
�2˜"Ó	€Bð
 ˆq�T�!�A•$˜•'�\˜A˜a�D  1¥ q¥�LÕ(¨1¨Q­4°°!µ°aµ­<Õ7¸!¸A½$¸qÀ½tÀQ½w½,ÕF€Fá�A‹Ù�AŒ�q˜!Óð€Fô
 ‹e€GÜ�9×ˆØˆqŒ5ä/°Ø8?Ø@I¼MôK‰DˆAð ×'Ñ'¨¸TÐ'ÓB‰ˆ�"ä˜¤×#Ò#Ùô " !Ó$ˆàŠ:÷ 9@Ð*×-Ñ-¨tÐ4ò <Ø/×2Ñ2°EÐ:ò<÷ à)×+Ñ+¨TÐ2Ò2ð •ˆð �[‰[œ˜Q¡ a£Ó)¸ˆ[Ó=ˆÙ)/Ó0© #ˆe�C�i˜�oˆo©ˆÐ0Ü�r˜1˜bÓ!ˆØ×&Ñ& qÓ)‰ˆˆq�!Ü˜U¤BÓ'ˆà�Œ6ÚÜ�Q�<Š<Ø)×,Ñ,¨eÐ4Ò4à)×,Ñ,¨eÐ4Ò4ñ] ô` Ðùò 1s   Ç;Jc                óx  € ^ RI Hp \        4       p\        V4       F<  p\	        V ^ 4      p\        V\        4      '       d    M\        WVV'       * R7      w  rpK>  	  \        h\        V\        4      p\        \        V^,           U	U
u. uF  w  rš\        V	4      ^,
          .V
,          NK!  	  up
p	. 4      4      pV^.8X  d.   \        V 4      '       d   VP                  R3# VP                  R3# V. RO8X  d   VP                   R3# V. RO8X  d   VP"                  R3# V^^.8X  g   Q hVP$                  R3# u up
p	i )zŽ
Compute the Galois group of a polynomial of degree 4.

Explanation
===========

Based on Alg 6.3.6 of [1], but uses resolvent coeff lookup.

r[   r]   TF©r$   r$   é   )é   r|   r|   )rS   r\   r1   r4   r   r   r   rL   r   r
   ÚsortedÚsumÚlenrP   rc   rd   rh   re   ri   )r<   r>   rV   r\   r?   rD   rp   ro   ÚflÚrÚeÚLs   &&&         r    Ú_galois_group_degree_4_lookupr„   þ   s@  € õ Aä‹e€GÜ�9ÖˆÜ'¨¨1Ó-ˆÜ�UœB×ÒÙÜ+¨AØ4;Ø<E¼ôG‰ˆ‰1ñ	 ô  Ðô 
˜¤Ó	#€BÜŒsØ%'¨¦UôÙ%*™T˜QŒˆQ‹�!�ˆ�q×Ð¡Uòà	óó 	€Að 	ˆQˆC„xÜ4CÀA×4FÒ4FÐ&×)Ñ)¨4Ð0ð 	4Ø'×*Ñ*¨EÐ2ð	4ð 	ŠI„~Ø%×(Ñ(¨%Ð0Ð0àŠI„~Ø%×'Ñ'¨Ð.Ð.à��A�Œ;Ðˆ;Ø!×$Ñ$ eÐ,Ð,ùós   Â%D6c           	     óÊ  € ^ RI Hp ^ RIHp \	        R4      p\        4       pVR,          w  rxp	VP                  ! V!  p\        WuV	4      p
\        4       pRp\        V4       EFt  pV^ 8”  d   \        WVV'       * R7      w  r€\        V ^4      p\        V\        4      '       g   KD  V'       gb   \        V 4      p\        V\        4      '       d)   V'       d   VP                   R3u # VP"                  R3u # V'       g   VP$                  R3u # RpV
P'                  V 4      pVP)                  4        F  w  pp\+        VV\        4      '       d   K   M	  TpV^ ,          V^,          ^,          ,          V^,          V^,          ^,          ,          ,           V^,          V^,          ^,          ,          ,           V^,          V^,          ^,          ,          ,           V^,          V^ ,          ^,          ,          ,           pV! ^4      V! ^4      ! ^ ^4      ! ^^4      .pXpV	V,          pVP-                  \/        VV! V4      4      RR7      pV Uu. uF  pVV,          V,          NK  	  pp\        VVV4      pVP1                  V 4      w  p p\3        V\        4      pV^ 8X  d   EKF  \5        V4      '       d   VP6                  R3u # VP8                  R3u # 	  \:        hu upi )	zÄ
Compute the Galois group of a polynomial of degree 5.

Explanation
===========

Based on Alg 6.3.9 of [1], but uses a hybrid approach, combining resolvent
coeff lookup, with root approximation.

©ÚS5TransitiveSubgroupsrY   zX0,X1,X2,X3,X4Fr]   Tr_   )é   r$   )rS   r‡   ra   rZ   r   r   Úas_exprr   r1   r4   rL   r   r   r   rP   r   ÚA5ÚS5ÚM20Ú round_roots_to_integers_for_polyÚitemsr   rf   rg   rb   r	   r   ÚC5ÚD5r   )r<   r>   rV   r‡   rZ   ÚX5ÚresÚF51ro   Ús51ÚR51r?   Úreached_second_stagerD   ÚR51_duprr   Úrounded_rootsÚpermutation_indexÚcandidate_rootr"   rm   rn   rq   rs   rt   ru   rv   rw   rp   rI   s   &&&                           r    Ú_galois_group_degree_5_hybridr›   )  s™  € õ AÝ<ä	Ð!Ó	"€BÜ
Ó
€CØ�f•+�K€CˆCØ
�+Š+�rÑ
€CÜ
�C˜SÓ
!€Cä‹e€GØ ÐÜ�9×ˆØˆqŒ5Ü/°Ø8?Ø@I¼MôK‰DˆAô *¨!¨QÓ/ˆÜ˜¤"×%Ò%Ù÷
 $Ü% aÓ(ˆGä  ¬"×-Ò-ß<CÐ.×1Ñ1°4Ð8ò @Ø3×6Ñ6¸Ð>ò@÷ Ø-×1Ñ1°5Ð9Ò9ð  $Ðð ×<Ñ<¸QÓ?ˆð 2?×1DÑ1DÖ1FÑ-Ð˜~Ü˜G ^´R×8Ô8Ùñ 2Gð ˆØ�1•�a˜•d˜A•g•  !¥ Q q¥T¨1¥W¥Õ,¨q°­t°A°aµD¸!µG­|Õ;¸aÀ½dÀ1ÀQÅ4ÈÅ7½lÕJÈQÈqÍTÐRSÐTUÕRVÐXYÕRYÍ\ÕYˆá˜‹NÙ˜ŒN˜1˜aÔ   AÓ&ð
ˆð
 ˆØ�B•ˆØ�[‰[œ˜Q¡ a£Ó)¸ˆ[Ó=ˆÙ)/Ó0© #ˆe�C�i˜�oˆo©ˆÐ0Ü�r˜1˜bÓ!ˆØ×&Ñ& qÓ)‰ˆˆq�!Ü˜U¤BÓ'ˆà�Œ6ÚÜ�Q�<Š<Ø)×,Ñ,¨dÐ3Ò3à)×,Ñ,¨dÐ3Ò3ñm ôp Ðùò 1s   ÉK c                óB  € ^ RI Hp T p\        4       p\        V4       F<  p\	        V ^4      p\        V\        4      '       d    M\        WVV'       * R7      w  r€K>  	  \        h\        V 4      p	\        V\        4      '       d%   V	'       d   VP                  R3# VP                  R3# V	'       g   VP                  R3# \        V\        P                  ! V4      R7      P!                  4       ^,          p
\#        V
4      ^8X  d   VP$                  R3# VP&                  R3# )z¾
Compute the Galois group of a polynomial of degree 5.

Explanation
===========

Based on Alg 6.3.9 of [1], but uses resolvent coeff lookup, plus
factorization over an algebraic extension.

r†   r]   TF)Údomain)rS   r‡   r1   r4   r   r   r   rL   r   rP   r   rŠ   r‹   rŒ   r   Úalg_field_from_polyÚfactor_listr   r�   r�   )r<   r>   rV   r‡   Ú_Tr?   rD   rp   ro   rr   r€   s   &&&        r    Ú(_galois_group_degree_5_lookup_ext_factorr¡   z  s
  € õ Aà	
€Bä‹e€GÜ�9ÖˆÜ'¨¨1Ó-ˆÜ�UœB×ÒÙÜ+¨AØ4;Ø<E¼ôG‰ˆ‰1ñ	 ô  Ðä˜aÓ €Gä˜¤×#Ò#ß4;Ð&×)Ñ)¨4Ð0ð 	8Ø+×.Ñ.°Ð6ð	8÷ Ø%×)Ñ)¨5Ð1Ð1ô
 
ˆbœ×/Ò/°Ó3Ô	4×	@Ñ	@Ó	BÀ1Õ	E€BÜ
ˆ2ƒw�!„|Ø%×(Ñ(¨$Ð/Ð/à%×(Ñ(¨$Ð/Ð/r   c                ó˜  € ^ RI Hp \        4       p\        V4       F<  p\	        V ^4      p\        V\        4      '       d    M\        WVV'       * R7      w  rpK>  	  \        h\        V\        4      p\        \        4      p	V^,           F-  w  r§V	\        V
4      ^,
          ,          P                  V
4       K/  	  \        \        V	P!                  4        UUu. uF  w  r¼V.\        V4      ,          NK  	  upp. 4      4      p\#        V 4      pV. RO8X  d>   V	^,          ^ ,          p\#        V4      '       d   VP$                  R3# VP&                  R3# V^^.8X  dO   V	^,          w  pp\#        V4      ;'       g    \#        V4      pV'       d   VP(                  R3# VP*                  R3# V^^.8X  dT   V'       d   VP,                  R3# V	^,          ^ ,          p\#        V4      '       d   VP.                  R3# VP0                  R3# V. RO8X  d%   V'       d   VP2                  R3# VP4                  R3# V^^.8X  d%   V'       d   VP6                  R3# VP8                  R3# V. RO8X  d   VP:                  R3# V^.8X  g   Q h\        4       p\        V4       F<  p\	        V ^4      p\        V\        4      '       d    M\        WVV'       * R7      w  rpK>  	  \        h\#        V 4      p\=        V\        4      '       d%   V'       d   VP>                  R3# VP@                  R3# V'       d   VPB                  R3# VPD                  R3# u uppi )z�
Compute the Galois group of a polynomial of degree 6.

Explanation
===========

Based on Alg 6.3.10 of [1], but uses resolvent coeff lookup.

)ÚS6TransitiveSubgroupsr]   FT)r$   r|   é   rz   )r$   r$   r$   r¤   )#rS   r£   r1   r4   r   r   r   rL   r   r
   r   Úlistr   Úappendr}   r~   rŽ   rP   ÚC6ÚD6ÚG18ÚG36mÚS4pÚA4xC2ÚS4xC2rc   ÚS4mÚPSL2F5ÚPGL2F5rU   r   ÚA6ÚS6ÚG36pÚG72)r<   r>   rV   r£   r?   rD   rp   ro   r€   Úfactors_by_degr�   rI   Úffrƒ   ÚT_has_sq_discÚf1Úf2Ú
any_squares   &&&               r    Ú_galois_group_degree_6_lookupr»   §  sM  € õ Aô ‹e€GÜ�9ÖˆÜ'¨¨1Ó-ˆÜ�UœB×ÒÙÜ+¨AØ4;Ø<E¼ôG‰ˆ‰1ñ	 ô  Ðä	˜¤Ó	#€Bô !¤Ó&€NØ�1—�‰ˆØ”s˜1“v •zÕ"×)Ñ)¨!Ö,ñ ô 	ŒsØ#1×#7Ñ#7Ô#9ôÙ#9™%˜!ˆˆŒc�"‹g�ˆÑ#9òà	óó 	€Aô $ AÓ&€MàŠI„~Ø˜AÕ˜qÕ!ˆÜ5DÀR×5HÒ5HÐ&×)Ñ)¨5Ð1ð 	8Ø+×.Ñ.°Ð6ð	8ð 
ˆq�!ˆfŒØ Õ"‰ˆˆBÜ$ RÓ(×?Ð?¬O¸BÓ,?ˆ
ß6@Ð&×*Ñ*¨EÐ2ð 	:Ø+×0Ñ0°%Ð8ð	:ð 
ˆq�!ˆfŒßØ)×-Ñ-¨tÐ4Ð4à Õ" 1Õ%ˆBÜ<KÈB×<OÒ<OÐ*×0Ñ0°%Ð8ð ?Ø/×5Ñ5°uÐ=ð?ð 
ŠiŒß4AÐ&×)Ñ)¨4Ð0ð 	9Ø+×/Ñ/°Ð7ð	9ð 
ˆq�!ˆfŒß8EÐ&×-Ñ-¨tÐ4ð 	<Ø+×2Ñ2°EÐ:ð	<ð 
ŠlÔ	Ø%×(Ñ(¨%Ð0Ð0à��Œ8€Oˆ8ô ‹e€GÜ�9ÖˆÜ'¨¨1Ó-ˆÜ�UœB×ÒÙÜ+¨AØ4;Ø<E¼ôG‰ˆ‰1ñ	 ô  Ðä# AÓ&€Mä˜¤×#Ò#ß4AÐ&×)Ñ)¨4Ð0ð 	8Ø+×.Ñ.°Ð6ð	8÷ 7DÐ&×+Ñ+¨TÐ2ð 	9Ø+×/Ñ/°Ð7ð	9ùóss   ÃMÚby_namer>   rV   c               ó¼   € T;'       g    . pT;'       g    / p \        V .VO5/ VB w  rgTP                  YTR7      #   \         d   p\        R^T4      hRp?ii ; i)al
  
Compute the Galois group for polynomials *f* up to degree 6.

Examples
========

>>> from sympy import galois_group
>>> from sympy.abc import x
>>> f = x**4 + 1
>>> G, alt = galois_group(f)
>>> print(G)
PermutationGroup([
(0 1)(2 3),
(0 2)(1 3)])

The group is returned along with a boolean, indicating whether it is
contained in the alternating group $A_n$, where $n$ is the degree of *T*.
Along with other group properties, this can help determine which group it
is:

>>> alt
True
>>> G.order()
4

Alternatively, the group can be returned by name:

>>> G_name, _ = galois_group(f, by_name=True)
>>> print(G_name)
S4TransitiveSubgroups.V

The group itself can then be obtained by calling the name's
``get_perm_group()`` method:

>>> G_name.get_perm_group()
PermutationGroup([
(0 1)(2 3),
(0 2)(1 3)])

Group names are values of the enum classes
:py:class:`sympy.combinatorics.galois.S1TransitiveSubgroups`,
:py:class:`sympy.combinatorics.galois.S2TransitiveSubgroups`,
etc.

Parameters
==========

f : Expr
    Irreducible polynomial over :ref:`ZZ` or :ref:`QQ`, whose Galois group
    is to be determined.
gens : optional list of symbols
    For converting *f* to Poly, and will be passed on to the
    :py:func:`~.poly_from_expr` function.
by_name : bool, default False
    If ``True``, the Galois group will be returned by name.
    Otherwise it will be returned as a :py:class:`~.PermutationGroup`.
max_tries : int, default 30
    Make at most this many attempts in those steps that involve
    generating Tschirnhausen transformations.
randomize : bool, default False
    If ``True``, then use random coefficients when generating Tschirnhausen
    transformations. Otherwise try transformations in a fixed order. Both
    approaches start with small coefficients and degrees and work upward.
args : optional
    For converting *f* to Poly, and will be passed on to the
    :py:func:`~.poly_from_expr` function.

Returns
=======

Pair ``(G, alt)``
    The first element ``G`` indicates the Galois group. It is an instance
    of one of the :py:class:`sympy.combinatorics.galois.S1TransitiveSubgroups`
    :py:class:`sympy.combinatorics.galois.S2TransitiveSubgroups`, etc. enum
    classes if *by_name* was ``True``, and a :py:class:`~.PermutationGroup`
    if ``False``.

    The second element is a boolean, saying whether the group is contained
    in the alternating group $A_n$ ($n$ the degree of *T*).

Raises
======

ValueError
    if *f* is of an unsupported degree.

MaxTriesException
    if could not complete before exceeding *max_tries* in those steps
    that involve generating Tschirnhausen transformations.

See Also
========

.Poly.galois_group

Úgalois_groupN)r¼   r>   rV   )r   r   r   r¾   )	Úfr¼   r>   rV   ÚgensÚargsÚFÚoptÚexcs	   &$$$*,   r    r¾   r¾     st   € ðD �:ˆ:�2€DØ�:ˆ:�2€Dð8Ü Ð1 DÒ1¨DÑ1‰ˆð �>‰> 'Ø$-ð ó /ð /øô ô 8Ü °°3Ó7Ð7ûð8ús   š> ¾AÁ	AÁA)é
   é   NT)rÆ   F).Ú__doc__Úcollectionsr   r8   Úsympy.core.symbolr   r   Úsympy.ntheory.primetestr   Úsympy.polys.domainsr   Úsympy.polys.densebasicr   Úsympy.polys.densetoolsr   Úsympy.polys.euclidtoolsr	   Úsympy.polys.factortoolsr
   r   Ú*sympy.polys.numberfields.galois_resolventsr   r   r   r   Ú"sympy.polys.numberfields.utilitiesr   Úsympy.polys.polytoolsr   r   r   r   Úsympy.polys.sqfreetoolsr   Úsympy.utilitiesr   r   rL   rP   rW   rx   r„   r›   r¡   r»   r¾   r   r   r    Ú<module>rÕ      sµ   ðñõ $Û ç ,Ý -Ý "Ý -Ý +Ý 4ß F÷ó õ <÷Jó Jå -Ý "ôÐ,ô ôhòVô4ôTôn(-ôVNôb*0ôZZ9ðz ðj/ 5ð j/°Bð j/À%ó j/ó òj/r   