Y by
Arthur Morgan is playing a game.
He has
eggs, each with a hardness value
, where
is a permutation of the set
. He is throwing the eggs from an
-floor building.
When the
-th egg is dropped from the
-th floor, its new hardness becomes
If
, then the egg breaks and cannot be used again.
Arthur can drop each egg from a particular floor at most once.
For which values of
and
can Arthur always determine the correct ordering of the eggs according to their initial hardness values?
Note: The problem might be wrong or too easy
He has





When the


![\[
\left\lfloor \frac{k_i}{j+1} \right\rfloor.
\]](http://latex.artofproblemsolving.com/7/5/8/7583af9655a43eb3f6167f955148984a468d4e70.png)

Arthur can drop each egg from a particular floor at most once.
For which values of


Note: The problem might be wrong or too easy
This post has been edited 1 time. Last edited by JARP091, May 25, 2025, 2:46 PM
Reason: Wrongly LaTeXted
Reason: Wrongly LaTeXted