Consider the cards with labels \( 1,\dots, n \) in some order. If the top card has label \(m \), we reverse the order of the top \( m \) cards. The process stops only when the card with label \( 1\) is on the top. Prove that the process must stop in at most \( (1.7)^n \) steps.
The best solution was submitted by 길현준 (수리과학과 2018학번). Congratulations!
Here is his solution of problem 2020-18.
Other solutions was submitted by 김유일 (2020학번, +3), 이준호 (수리과학과 2016학번, +3).