InverseJacobiNC[v, m] gives the inverse Jacobi elliptic function nc -1 (v \[VerticalSeparator] m).
MoebiusMu[n] gives the Möbius function \[Mu](n).
UniformGraphDistribution[n, m] represents a uniform graph distribution on n-vertex, m-edge graphs.
HypergeometricPFQ[{a_1, ..., a_p}, {b_1, ..., b_q}, z] is the generalized hypergeometric function \[Null]_p F_q (a; b; z).
Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...
HistogramList[{x_1, x_2, ...}] gives a list of bins and histogram heights of the values x_i.HistogramList[{{x_1, y_1, ...}, {x_2, y_2, ...}, ...}] gives a list of bins and ...
VectorPoints is an option to VectorPlot, ListVectorPlot, and related functions that determines how many field vectors to draw.
BinLists[{x_1, x_2, ...}] gives lists of the elements x_i whose values lie in successive integer bins.BinLists[{x_1, x_2, ...}, dx] gives lists of the elements x_i whose ...
SphericalBesselJ[n, z] gives the spherical Bessel function of the first kind j_n (z).
SphericalBesselY[n, z] gives the spherical Bessel function of the second kind y_n (z).