Mathematica contains hundreds of original algorithms for computing integer functions involving integers of any size.

FrobeniusNumber[{a_1, ..., a_n}] gives the Frobenius number of a_1, ..., a_n.

Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...

Mathematica contains the world's largest collection of number theoretic functions, many based on specially developed algorithms.

Packing a large number of sophisticated algorithms—many recent and original—into a powerful collection of functions, Mathematica draws on almost every major result in number ...

Combinatorial functions. The factorial function n! gives the number of ways of ordering n objects. For non-integer n, the numerical value of n! is obtained from the gamma ...

Mathematica 6.0 represented a major new level in Mathematica's distinguished twenty-year history of broad cutting-edge algorithm development. Mathematica's unified ...

Subsets[list] gives a list of all possible subsets of list. Subsets[list, n] gives all subsets containing at most n elements. Subsets[list, {n}] gives all subsets containing ...

BellB[n] gives the Bell number B_n. BellB[n, x] gives the Bell polynomial B_n (x).

LCM[n_1, n_2, ...] gives the least common multiple of the n_i.