MathCastle
PutnamSuperchallengeIntegrals I: Feynman's Trick

Integrals I: Feynman's Trick · Superchallenge problem

Working backwards: a game starts at 11; a move multiplies the current number by 22 or adds 11. What is the minimum number of moves needed to reach 10001000?