File size: 3,432 Bytes
b66f126
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
.. _combinatorial-functions:

Combinatorial
=============

This module implements various combinatorial functions.

.. autoclass:: sympy.functions.combinatorial.numbers.bell
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.bernoulli
   :members:

.. autoclass:: sympy.functions.combinatorial.factorials.binomial
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.catalan
   :members:


.. autoclass:: sympy.functions.combinatorial.numbers.euler
   :members:


.. autoclass:: sympy.functions.combinatorial.factorials.factorial
   :members:

.. autoclass:: sympy.functions.combinatorial.factorials.subfactorial
   :members:

.. autoclass:: sympy.functions.combinatorial.factorials.factorial2
   :members:


.. autoclass:: sympy.functions.combinatorial.factorials.FallingFactorial
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.fibonacci
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.tribonacci
   :members:


.. autoclass:: sympy.functions.combinatorial.numbers.harmonic
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.lucas
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.genocchi
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.andre
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.partition
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.divisor_sigma
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.udivisor_sigma
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.legendre_symbol
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.jacobi_symbol
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.kronecker_symbol
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.mobius
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.primenu
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.primeomega
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.totient
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.reduced_totient
   :members:

.. autoclass:: sympy.functions.combinatorial.numbers.primepi
   :members:

.. autoclass:: sympy.functions.combinatorial.factorials.MultiFactorial
   :members:


.. autoclass:: sympy.functions.combinatorial.factorials.RisingFactorial
   :members:

.. autofunction:: sympy.functions.combinatorial.numbers.stirling

Enumeration
===========

Three functions are available. Each of them attempts to efficiently compute
a given combinatorial quantity for a given set or multiset which can be
entered as an integer, sequence or multiset (dictionary with
elements as keys and multiplicities as values). The ``k`` parameter indicates
the number of elements to pick (or the number of partitions to make). When
``k`` is None, the sum of the enumeration for all ``k`` (from 0 through the
number of items represented by ``n``) is returned. A ``replacement`` parameter
is recognized for combinations and permutations; this indicates that any item
may appear with multiplicity as high as the number of items in the original
set.

>>> from sympy.functions.combinatorial.numbers import nC, nP, nT
>>> items = 'baby'

.. autofunction:: sympy.functions.combinatorial.numbers.nC

.. autofunction:: sympy.functions.combinatorial.numbers.nP

.. autofunction:: sympy.functions.combinatorial.numbers.nT