Ez egy kedves pelda, ajanlom mindenkinek:
Problem In each of six boxes B1,B2,B3,B4,B5,B6 there is initially one coin. There are two types of operation allowed:
Type 1: Choose a nonempty box Bj with 1 \leq j \leq 5. Remove one coin from Bj and add two coins to Bj + 1.
Type 2: Choose a nonempty box Bk with 1 \leq k \leq 4. Remove one coin from Bk and exchange the contents of (possibly empty) boxes Bk + 1 and Bk + 2.
Determine whether there is a finite sequence of such operations that results in boxes B1,B2,B3,B4,B5 being empty and box B6 containing exactly 2010^{2010^{2010}} coins.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: