IntegerPartitions[n] gives a list of all possible ways to partition the integer n into smaller integers. IntegerPartitions[n, k] gives partitions into at most k integers. ...
Implicit Runge–Kutta methods have a number of desirable properties. The Gauss–Legendre methods, for example, are self-adjoint, meaning that they provide the same solution ...
Here is one way to get multiple minima: call NMinimize multiple times with different random seeds, which will cause different optimization paths to be taken. This defines a ...
JacobiSN[u, m] gives the Jacobi elliptic function sn(u | m).
Discriminant[poly, var] computes the discriminant of the polynomial poly with respect to the variable var.Discriminant[poly, var, Modulus -> p] computes the discriminant ...
JacobiCN[u, m] gives the Jacobi elliptic function cn(u | m).
JacobiDN[u, m] gives the Jacobi elliptic function dn(u | m).
ExpIntegralE[n, z] gives the exponential integral function E_n (z).
FindGeneratingFunction[{a_1, a_2, ...}, x] attempts to find a simple generating function in x whose n\[Null]^th series coefficient is a_n.FindGeneratingFunction[{{n_1, a_1}, ...
InverseJacobiDC[v, m] gives the inverse Jacobi elliptic function dc -1 (v \[VerticalSeparator] m).