g#zddlmZmZddlmZddlmZddlmZde de fdZ de fdZ de fd Z de fd Zd Zd Zd S))chain combinations)gcd) factorint)as_intfactorsreturnc|D]C}|D],\}}d}t|D]}||z|z}|dkrdS-DdS)z Check whether `n` is a nilpotent number. Note that ``factors`` is a prime factorization of `n`. This is a low-level helper for ``is_nilpotent_number``, for internal use. FT)keysitemsrange)rpqem_s ]/var/www/html/ai-engine/env/lib/python3.11/site-packages/sympy/combinatorics/group_numbers.py_is_nilpotent_numberrs \\^^!!MMOO ! !DAqA1XX ! !aC!G66 5555 !  ! 4ct|}|dkrtd|ztt|S)aj Check whether `n` is a nilpotent number. A number `n` is said to be nilpotent if and only if every finite group of order `n` is nilpotent. For more information see [1]_. Examples ======== >>> from sympy.combinatorics.group_numbers import is_nilpotent_number >>> from sympy import randprime >>> is_nilpotent_number(21) False >>> is_nilpotent_number(randprime(1, 30)**12) True References ========== .. [1] Pakianathan, J., Shankar, K., Nilpotent Numbers, The American Mathematical Monthly, 107(7), 631-634. .. [2] https://oeis.org/A056867 r$n must be a positive integer, not %i)r ValueErrorrr)ns ris_nilpotent_numberrs@0 q AAvv?!CDDD  ! - --rct|}|dkrtd|zt|}td|Dot |S)a Check whether `n` is an abelian number. A number `n` is said to be abelian if and only if every finite group of order `n` is abelian. For more information see [1]_. Examples ======== >>> from sympy.combinatorics.group_numbers import is_abelian_number >>> from sympy import randprime >>> is_abelian_number(4) True >>> is_abelian_number(randprime(1, 2000)**2) True >>> is_abelian_number(60) False References ========== .. [1] Pakianathan, J., Shankar, K., Nilpotent Numbers, The American Mathematical Monthly, 107(7), 631-634. .. [2] https://oeis.org/A051532 rrc3"K|] }|dkV dS)N.0rs r z$is_abelian_number..Vs&//q1u//////rrrrallvaluesrrrs ris_abelian_numberr'8sl4 q AAvv?!CDDDllG //gnn../// / / Q4H4Q4QQrct|}|dkrtd|zt|}td|Dot |S)a Check whether `n` is a cyclic number. A number `n` is said to be cyclic if and only if every finite group of order `n` is cyclic. For more information see [1]_. Examples ======== >>> from sympy.combinatorics.group_numbers import is_cyclic_number >>> from sympy import randprime >>> is_cyclic_number(15) True >>> is_cyclic_number(randprime(1, 2000)**2) False >>> is_cyclic_number(4) False References ========== .. [1] Pakianathan, J., Shankar, K., Nilpotent Numbers, The American Mathematical Monthly, 107(7), 631-634. .. [2] https://oeis.org/A003277 rrc3"K|] }|dkV dSr Nrr s rr"z#is_cyclic_number..ws&00!qAv000000rr#r&s ris_cyclic_numberr+Ysl4 q AAvv?!CDDDllG 00w~~//000 0 0 R5I'5R5RRrc\fdD}|z d}tjfdttdzD}|D]S}t |}d}|z D]5tfd||zD}||zdz dz zz}|sn6||z }T|S)a| Number of groups of order `n`. where `n` is squarefree and its prime factors are ``prime_factors``. i.e., ``n == math.prod(prime_factors)`` Explanation =========== When `n` is squarefree, the number of groups of order `n` is expressed by .. math :: \sum_{d \mid n} \prod_p \frac{p^{c(p, d)} - 1}{p - 1} where `n=de`, `p` is the prime factor of `e`, and `c(p, d)` is the number of prime factors `q` of `d` such that `q \equiv 1 \pmod{p}` [2]_. The formula is elegant, but can be improved when implemented as an algorithm. Since `n` is assumed to be squarefree, the divisor `d` of `n` can be identified with the power set of prime factors. We let `N` be the set of prime factors of `n`. `F = \{p \in N : \forall q \in N, q \not\equiv 1 \pmod{p} \}, M = N \setminus F`, we have the following. .. math :: \sum_{d \in 2^{M}} \prod_{p \in M \setminus d} \frac{p^{c(p, F \cup d)} - 1}{p - 1} Practically, many prime factors are expected to be members of `F`, thus reducing computation time. Parameters ========== prime_factors : set The set of prime factors of ``n``. where `n` is squarefree. Returns ======= int : Number of groups of order ``n`` Examples ======== >>> from sympy.combinatorics.group_numbers import _holder_formula >>> _holder_formula({2}) # n = 2 1 >>> _holder_formula({2, 3}) # n = 2*3 = 6 2 See Also ======== groups_count References ========== .. [1] Otto Holder, Die Gruppen der Ordnungen p^3, pq^2, pqr, p^4, Math. Ann. 43 pp. 301-412 (1893). http://dx.doi.org/10.1007/BF01443651 .. [2] John H. Conway, Heiko Dietrich and E.A. O'Brien, Counting groups: gnus, moas and other exotica The Mathematical Intelligencer 30, 6-15 (2008) https://doi.org/10.1007/BF02985731 cLh|]tfdD S)c3*K|] }|zdkVdSr*rr!rrs rr"z,_holder_formula...s+(K(KQ!(K(K(K(K(K(Kr)r$)r!r prime_factorss @r z"_holder_formula..s<LLLqS(K(K(K(K](K(K(K%K%KLLLLrrc38K|]}t|VdS)N)r)r!rMs rr"z"_holder_formula..s-"O"O!<1#5#5"O"O"O"O"O"Orr c&g|] }|zdk |S)r rr/s r z#_holder_formula..s"5551!a%1**Q***r)r from_iterablerlenset) r0Fspowersetpsprodcr4rs ` @@r_holder_formular@zs~ MLLLMLLLAA A""O"O"O"OuSVVAX"O"O"OOOH WWR  A5555B55566A QTAX1q5) )D   T  Hrc t|}|dkrtd|zt|}t|dkrt |d\}}|dkrgd}|t|kr||S|dkrgd}|t|kr||S|dkr|S|dkrdS|d krd S|dkr3d d|zzdt |dz dzzt |dz d zS|d krVd|dzzd |zzdzdt |dz dzzdt |dz d zzdt |dz dzzS|dkr|dkrdSd|dzzd|d zzzd|dzzzd|dzzzd|zzdzd |dzzd|zzdzt |dz dzz|dzd|zzdzt |dz d zzd|zdzt |dz dzzd t |dz dzzdt |dz dzzt |dz dzStd|Dr[iddddd ddd d!d d"d#d$d#dd d%dd&d'd(dd'dd)d d*d+d,d+d-d d.dd(dd d'd dd/d d0}||vr||Std1t|dkr;t | \}}||kr||}}||zdkrdndStt| S)2a Number of groups of order `n`. In [1]_, ``gnu(n)`` is given, so we follow this notation here as well. Parameters ========== n : Integer ``n`` is a positive integer Returns ======= int : ``gnu(n)`` Raises ====== ValueError Number of groups of order ``n`` is unknown or not implemented. For example, gnu(`2^{11}`) is not yet known. On the other hand, gnu(12) is known to be 5, but this has not yet been implemented in this function. Examples ======== >>> from sympy.combinatorics.group_numbers import groups_count >>> groups_count(3) # There is only one cyclic group of order 3 1 >>> # There are two groups of order 10: the cyclic group and the dihedral group >>> groups_count(10) 2 See Also ======== is_cyclic_number `n` is cyclic iff gnu(n) = 1 References ========== .. [1] John H. Conway, Heiko Dietrich and E.A. O'Brien, Counting groups: gnus, moas and other exotica The Mathematical Intelligencer 30, 6-15 (2008) https://doi.org/10.1007/BF02985731 .. [2] https://oeis.org/A000001 rrr ) r r rB3i i ii!lyLZ .r) r r rBrCCii^$imMlNCrCrF='iX i ,ii i# c3"K|] }|dkV dSr*rr s rr"zgroups_count..s& + +Q1q5 + + + + + +r$rD(-04268 <?D )HKLPTXZ\z9Number of groups of order n is unknown or not implemented) rrrr8listr ranyr%r r@r9)rrrrA000679A090091smallrs r groups_countrusId q AAvv?!CDDDllG 7||qgmmoo&&q)A 66SSSG3w<<qz! 66JJJG3w<<qz! 66H 661 662 66!8aAaC m+c!A#qkk9 9 66QT6BqD=3&S1a[[.!#%c!A#qkk>245c!A#qkkMB B 66AvvuQT6Bq!tG#bAg-AqD83q5@4GQT6BqD=3&AaC 3478!tbd{S7H#aPQcST++6UVQ38S1a[[()+,S1a[[=9;r|s))))))))######++++++''''''$4$.d....<RDRRRRBS4SSSSBM M M `^0^0^0^0^0r