gives the n^(th) largest element in list.


gives the n^(th) smallest element in list.


  • RankedMax yields a definite result if all its arguments are real numbers.
  • RankedMax[{x1,,xm},1] is equivalent to Max[{x1,,xm}].
  • RankedMax[{x1,,xm},-1] is equivalent to Min[{x1,,xm}].
  • RankedMax[{x1,,xm},m] is equivalent to Min[{x1,,xm}].
  • RankedMax[{x1,,xm},n] is equivalent to Quantile[{x1,,xm},(m-n+1)/m].


open allclose all

Basic Examples  (3)

The second largest of three numbers:

The third largest of four numbers:

Plot the second-largest function over a subset of the reals:

Scope  (17)

Numerical Evaluation  (4)

Evaluate the second largest of three numbers:

The fourth largesti.e the smallestof four numbers:

The second smallest of five numbers:

The fourth smallest of five numbers:

The fifth smallesti.e. the largestof five numbers:

Evaluate to high precision:

Evaluate efficiently at high precision:

Specific Values  (4)

Values at infinity:

Evaluate symbolically:

Solve equations and inequalities:

Find a value of x for which RankedMax[{Sin[x],Cos[x],Exp[x]},2]1:

Visualization  (3)

Plot RankedMax of several functions:

Plot RankedMax in three dimensions:

Plot RankedMax of three functions in three dimensions:

Function Properties  (3)

RankedMax is only defined for real-valued inputs:

The range of RankedMax is real numbers:

Basic symbolic simplification is done automatically:

Series and Integration  (3)

Series expansion of the second-largest function at the origin:

Asymptotic expansion at Infinity:

Integrate expressions involving RankedMax:

Applications  (6)

Plot the bivariate RankedMax functions:

Plot the contours of bivariate and trivariate RankedMax functions:

RankedMax[{y1,,yn,x},k] as a function of x:

Compute the expectation of the second smallest (median) variable:

Alternatively, use OrderDistribution:

Compute the probability of the second smallest variable being less than 1:

Find the height of the fourth tallest child in a class:

Properties & Relations  (6)

RankedMax[{x1,,xn},1] is equivalent to Max[x1,,xn]: »

RankedMax[{x1,,xn},n] is equivalent to Min[x1,,xn]: »

RankedMax[{x1,,xn},k] is equivalent to RankedMin[{x1,,xn},n-k+1]:

RankedMax[{x1,,xn},m] is equivalent to Quantile[{x1,,xn},(m-n+1)/n]: »

RankedMax[{x1,,xn},k] is equivalent to Sort[{x1,,xn},Greater]k:

The equivalent Piecewise function has disjoint piecewise case domains:

Algebraically prove the piecewise case domains are disjoint:

Visually show it:

Algebraically prove the piecewise case domains are pairwise disjoint:

Visually show it:

Neat Examples  (2)

Two-dimensional sublevel sets:

Three-dimensional sublevel sets:

Introduced in 2010
Updated in 2017