olymmath

NMC 2015 Problem 4

  • Answer

An encyclopedia consists of 2000 numbered volumes. The volumes are stacked in order with number 1 on top and 2000 in the bottom. One may perform two operations with the stack:

(i) For nn even, one may take the top nn volumes and put them in the bottom of the stack without changing the order.

(ii) For nn odd, one may take the top nn volumes, turn the order around and put them on top of the stack again.

How many different permutations of the volumes can be obtained by using these two operations repeatedly?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

(1000!)^2

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator nordic/2015/p4 · Tag 8VN6P7J7KX · Edit this page on GitHub · Keys: j next, k previous