On a table there is a pile with 2001 tokens
Source: Cono Sur 1993-problem 1, Germany Bundeswettbewerb Mathematik 2001, Round 1, Problem 1
May 30, 2006
algebra unsolvedalgebra
Problem Statement
On a table there is a pile with tokens which incrementally shall be converted into piles with three tokens each. Each step is constituted of selecting one pile removing one of its tokens. And then the remaining pile is separated into two piles. Is there a sequence of steps that can accomplish this process?
a.) T \equal{} 1000 (Cono Sur)
b.) T \equal{} 2001 (BWM)