cards numbered to are to be lined up in a row. Find the number of arrangements of these cards where one of the cards can be removed leaving the remaining cards in either ascending or descending order.
Source: American Invitational Mathematical Olympiad(AIME) - paper
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
No explanations have been posted yet. Check back later!