Question 2
Three knights attack a dragon. The first removes half its current heads plus 1; the second removes one third plus 2; the third removes one quarter plus 3. Each attack must remove an integer number of existing heads. They may choose any order and repeat attacks; if no legal attack exists the dragon wins. Can they remove all heads when the initial count is $41!$?