x <= y or x <= y yields True if x is determined to be less than or equal to y. x_1 <= x_2 <= x_3 yields True if the x TraditionalForm\`i form a nondecreasing sequence.

x < y yields True if x is determined to be less than y. x_1 < x_2 < x_3 yields True if the x_i form a strictly increasing sequence.

LogGammaDistribution[\[Alpha], \[Beta], \[Mu]] represents a log-gamma distribution with shape parameters \[Alpha] and \[Beta] and location parameter \[Mu].

NProduct[f, {i, i_min, i_max}] gives a numerical approximation to the product \[Product]i = i_min i_max f.NProduct[f, {i, i_min, i_max, di}] uses a step di in the product.

RootApproximant[x] converts the number x to one of the "simplest" algebraic numbers that approximates it well.RootApproximant[x, n] finds an algebraic number of degree at ...

SmoothKernelDistribution[{x_1, x_2, ...}] represents a smooth kernel distribution based on the data values x_i.SmoothKernelDistribution[{{x_1, y_1, ...}, {x_2, y_2, ...}, ...

VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

NDSolve returns solutions as InterpolatingFunction objects. Most of the time, simply using these as functions does what is needed, but occasionally it is useful to access the ...

Some operators used in basic arithmetic and algebra. Note that the  for ∖[Cross] is distinguished by being drawn slightly smaller than the × for ∖[Times]. Interpretation of ...