How many coins are possible?

Calvin put 2001 coins of 1, 2 or 3 dollars in a row. It turned out that between any two 1-dollar coins there is at least one coin; between any two 2-dollar coins there are at least two coins; and between any two 3-dollar coins there are at least 3 coins. There are k k three dollar coins. How many values of k k are possible?


Image Credit: Flickr Jamal Ashiqain .


The answer is 2.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Ivan Koswara
Oct 25, 2015

Let a i a_i be the value of the i i -th coin in dollars. Thus { a i } i = 1 2001 \{a_i\}_{i=1}^{2001} is a sequence of integers, where a i { 1 , 2 , 3 } a_i \in \{1,2,3\} , where if a i = a j a_i = a_j then i j a i + 1 |i-j| \ge a_i+1 .

Suppose i 4 i \ge 4 and a i = 3 a_i = 3 . Clearly a i 1 3 a_{i-1} \neq 3 . If a i 1 = 2 a_{i-1} = 2 , then a i 2 = 1 a_{i-2} = 1 is forced, and a i 3 a_{i-3} has no possible choice, contradiction. So a i 1 = 1 a_{i-1} = 1 . By symmetry, this also proves that if i 1998 i \le 1998 and a i = 3 a_i = 3 , then a i + 1 = 1 a_{i+1} = 1 .

Likewise, if 2 i 1999 2 \le i \le 1999 and a i = 2 a_i = 2 , then a i 1 = 1 a_{i-1} = 1 (it can't be 2 2 for obvious reasons, and if it's 3 3 then we get the case above), and similarly if 3 i 2000 3 \le i \le 2000 and a i = 2 a_i = 2 then a i + 1 = 1 a_{i+1} = 1 .

These claims prove that for 4 i 1998 4 \le i \le 1998 , whenever there is a 2 2 or a 3 3 , both two adjacent numbers must be 1 1 's; that is, if a i 1 a_i \neq 1 , then a i 1 = a i + 1 = 1 a_{i-1} = a_{i+1} = 1 . Additionally, a i + 2 1 a_{i+2} \neq 1 (collision with a i + 1 a_{i+1} ) and a i + 2 a i a_{i+2} \neq a_i (because a i 2 a_i \ge 2 ), so a i + 2 a_{i+2} is forced ( 5 a i 5 - a_i ). If i + 2 1998 i+2 \le 1998 , this forces that a i + 3 = 1 a_{i+3} = 1 and a i + 4 = a i a_{i+4} = a_i , and so on.

Basically, the above proves that between 3 i 1999 3 \le i \le 1999 , the sequence a i a_i is periodic, with the repeated part 1 , 2 , 1 , 3 1,2,1,3 , only with potentially different starting offset. This gives only four cases to consider:

  • ? , ? , 1 , 2 , 1 , 3 , , 2 , 1 , 3 , 1 , ? , ? ?, ?, 1, 2, 1, 3, \ldots, 2, 1, 3, 1, ?, ? : We know a 2 = 3 a_2 = 3 is forced, and subsequently a 1 , a 2000 , a 2001 3 a_1, a_{2000}, a_{2001} \neq 3 . There are 500 500 terms equal to 3 3 .
  • ? , ? , 2 , 1 , 3 , 1 , , 1 , 3 , 1 , 2 , ? , ? ?, ?, 2, 1, 3, 1, \ldots, 1, 3, 1, 2, ?, ? : We know a 2 = a 2000 = 1 a_2 = a_{2000} = 1 are forced, which in turn forces a 1 = a 2001 = 3 a_1 = a_{2001} = 3 . There are 501 501 terms equal to 3 3 .
  • ? , ? , 1 , 3 , 1 , 2 , , 3 , 1 , 2 , 1 , ? , ? ?, ?, 1, 3, 1, 2, \ldots, 3, 1, 2, 1, ?, ? : This is just the reverse of the first case.
  • ? , ? , 3 , 1 , 2 , 1 , , 1 , 2 , 1 , 3 , ? , ? ?, ?, 3, 1, 2, 1, \ldots, 1, 2, 1, 3, ?, ? : We know the unknown terms cannot be 3 3 . There are 500 500 terms equal to 3 3 .

Thus there are either 500 500 or 501 501 terms equal to 3 3 , so there are 2 \boxed{2} such possibilities.

Moderator note:

Great argument that determines all possible arrangements of this setup.

Alan Yan
Oct 24, 2015

It is easy to see that every consecutive four coins must include exactly one three dollar coin. It is also easy to see that they must be separated by exactly three coins. Thus, the only values are 500 500 and 501 501 .

You should explain that claim in further detail. Yes, it is obvious after you play around with it, but the hard part comes from giving a succinct explanation.

You have hit the nail on the head with this observation.

Calvin Lin Staff - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...