Combinatorics
Same convention as integer number theory: integer-leaf expressions in, integer-leaf expressions out; non-integer input raises, as do arguments outside each function's domain (negative counts, …).
falling_factorial#
Default context
falling_factorial(
base: ExpressionLike,
length: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.falling_factorial
falling_factorial(
base: ExpressionLike,
length: ExpressionLike,
) -> Expression; length must be a non-negative integer,
base may be any integer.
rising_factorial#
Default context
rising_factorial(
base: ExpressionLike,
length: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.rising_factorial
rising_factorial(
base: ExpressionLike,
length: ExpressionLike,
) -> Expression(the Pochhammer symbol on integers).
stirling_first_signed#
Default context
stirling_first_signed(
n: ExpressionLike,
k: ExpressionLike,
) -> ExpressionCalling forms
Explicit context: Context.stirling_first_signed
stirling_first_signed(
n: ExpressionLike,
k: ExpressionLike,
) -> ExpressionSigned Stirling number of the first kind s(n, k).
stirling_second#
Default context
stirling_second(n: ExpressionLike, k: ExpressionLike) -> ExpressionCalling forms
Explicit context: Context.stirling_second
stirling_second(n: ExpressionLike, k: ExpressionLike) -> ExpressionStirling number of the second kind S(n, k).
bell_number#
Default context
bell_number(n: ExpressionLike) -> ExpressionThe n-th Bell number.
catalan_number#
Default context
catalan_number(n: ExpressionLike) -> ExpressionCalling forms
Explicit context: Context.catalan_number
catalan_number(n: ExpressionLike) -> ExpressionThe n-th Catalan number.
fibonacci_number#
Default context
fibonacci_number(n: ExpressionLike) -> ExpressionCalling forms
Explicit context: Context.fibonacci_number
fibonacci_number(n: ExpressionLike) -> ExpressionThe n-th Fibonacci number (F(0) = 0, F(1) = 1).
partition_count#
Default context
partition_count(n: ExpressionLike) -> ExpressionCalling forms
Explicit context: Context.partition_count
partition_count(n: ExpressionLike) -> ExpressionNumber of integer partitions p(n).
multinomial#
Default context
multinomial(parts: Iterable[ExpressionLike]) -> ExpressionCalling forms
Explicit context: Context.multinomial
multinomial(parts: Iterable[ExpressionLike]) -> ExpressionMultinomial coefficient ; parts must be non-negative integers.
Example#
Exact counting sequences stay exact at any size.
import symi
print(symi.binomial(52, 5))
print(symi.factorial(30))
print(symi.catalan_number(12))
print(symi.stirling_second(8, 3))
print(symi.partition_count(100))