The advanced Australian shuffle (Q524952)

The author starts with a card trick: four cards are given to a spectator, one of each suit and then the spectator arranges the card arbitrarily with just the condition of being alternating between red and black cards; then the magician asks the spectator to look at the top card and then asks her to put one by one as many cards from the top to the bottom of the deck as the number of letters in the suit of this card (here the suits are called by their German names); the card that is now on the top is removed; this process is repeated three times and and when the spectator is left with only one card then the magician correctly predicts that it is a club. This trick is generalized by the author in the subsequent parts of the paper under review. In order to not sound too verbose in this review, we just mention the important points of the author's generalization. Consider the sequences \((a_1, a_2, \ldots, a_n)\) of nonnegative integers, where \(a_1\) is moved one-by-one to the end and the number that is now in the beginning is removed. After \(n-1\) iterations only one number remains. Such a sequence is called \textit{good} if for any cyclic rotation of the starting sequence the same number remains at the end. The author poses several natural questions about such sequences and proves quite a few of them. The main result of the paper is that such nontrivial good sequences exists for any \(n\). The paper ends with a few more card tricks involving these sequences.