MathDB

Eric and Christina are playing a game with

n

stones. They alternate taking some number of stones from the pile, with Eric going first. The number of stones Eric takes from the pile must be a power of

3

(e.g. 1, 3, 9, 27, ...), while the number of stones Christina takes must be a power of

2

(e.g. 1, 2, 4, 8, ...). Whoever takes the last stone wins. Find the sum of all

1\leq n \leq 100

for which Eric has a winning strategy.
Proposed by Connor Gordon

Problem Statement