Y by
Fix an integer
. Consider
real numbers
and
. Let
be the set of all pairs
of real numbers for which
,
are pairwise distinct. For every such pair sort the corresponding values
increasingly and let
be the
-th term in the list thus sorted. This denes an index permutation of
. Let
be the number of all such permutations, as the pairs run through all of
. In terms of
, determine the largest value
may achieve over all possible choices of
.

















This post has been edited 1 time. Last edited by Assassino9931, May 2, 2025, 11:00 PM