1998 AIME Problems/Problem 15
Contents
Problem
Define a domino to be an ordered pair of distinct positive integers. A proper sequence of dominos is a list of distinct dominos in which the first coordinate of each pair after the first equals the second coordinate of the immediately preceding pair, and in which and do not both appear for any and . Let be the set of all dominos whose coordinates are no larger than 40. Find the length of the longest proper sequence of dominos that can be formed using the dominos of
Solution 1
We can draw a comparison between the domino a set of 40 points (labeled 1 through 40) in which every point is connected with every other point. The connections represent the dominoes.
You need to have all even number of segments coming from each point except 0 or 2 which have an odd number of segments coming from the point. (Reasoning for this: Everytime you go to a vertex, you have to leave the vertex, so every vertex reached is equivalent to adding 2 more segments. So the degree of each vertex must be even, with the exception of endpoints) Since there are 39 segments coming from each point it is impossible to touch every segment.
But you can get up to 38 on each segment because you go in to the point then out on a different segment. Counting going out from the starting and ending at the ending point we have:
Clarification
To clarify the above solution, every time you move to a new vertex, you take one path in and must leave by another path. Therefore every vertex needs to have an even number of segments leaving it (with the exception of the first and last), because the "in" and "out" segments must make a pair.
Solution 2
A proper sequence can be represented by writing the common coordinates of adjacent ordered pairs once. For example, represent (4,7),(7,3),(3,5) as Label the vertices of a regular -gon Each domino is thereby represented by a directed segment from one vertex of the -gon to another, and a proper sequence is represented as a path that retraces no segment. Each time that such a path reaches a non-terminal vertex, it must leave it.
Thus, when is even, it is not possible for such a path to trace every segment, for an odd number of segments emanate from each vertex. By removing suitable segments, however, it can be arranged that segments will emanate from of the vertices and that an odd number of segments will emanate from exactly two of the vertices.
In this situation, a path can be found that traces every remaining segment exactly once, starting at one of the two exceptional vertices and finishing at the other. This path will have length which is 761 when .
~phoenixfire
Note 1
When is odd, a proper sequence of length can be found using the dominos of . In this case, the second coordinate of the final domino equals the first coordinate of the first domino.
~phoenixfire
Solution 3
Let and be the set of dominos that can be formed using integers in Each in appears in dominos in hence appears at most times in a proper sequence from Except possibly for the integers and that begin and end a proper sequence, every integer appears an even number of times in the sequence.
Thus, if is even, each integer different from and appears on at most dominos in the sequence, because is even, and and themselves appear on at most dominos each. This gives an upper bound of
dominos in the longest proper sequence in This bound is in fact attained for every even It is easy to verify this for , so assume inductively that a sequence of this length has been found for a particular value of .
Without loss of generality, assume and and let denote a four-domino sequence of the form By appending
to the given proper sequence, a proper sequence of length
is obtained that starts at and ends at This completes the inductive proof.
In particular, the longest proper sequence when is 761.
~phoenixfire
Note 2
In the language of graph theory, this is an example of an Eulerian circuit.
~phoenixfire
Solution 4
Consider the segments joining the vertices of a regular -gon. For odd , we see that the number of segments is quite easily . This is because every vertex touches every other vertex the same number of times. ( times to be exact). Hence the answer for odd cases is . (This is because a segment that starts at the first vertex also ends at the first vertex). For even however, every vertex touches vertices. However, one may be motivated to say that the answer (as in the odd case) is . But this is incorrect, because for the even case, it never ends at the vertex (the first vertex) you started at. So it must end at another vertex. But that vertex has already other segments touching it. So we have that the final answer is plus . The case for , is .
~th1nq3r
Note
The reason it touches every single other vertex for odd is because there are a total of segments, and once dividing by , you will then have the number of segments that are connected to each vertex. For the even case every vertex has at least other segments touching it. This is because (you CAN convince yourself through a painful induction/observation argument, but you probably shouldn't) is even, and if you try to apply the odd case to the even case, (namely that there is segments touching each vertex), there would have to then be total segments, which never works since it never loops back to the vertex you started on). So at LEAST, there should be segments touching each vertex. However, there is also at most segments touching each vertex. Hence by the (what I call) the "less-than-or-greater-than" argument, there must be segments out of each vertex. (Mind the plus one extra vertex since once again, the vertex you started on, it doesn't loop around, so it must end at another vertex). Hence the answer is .
(I am not very good at explaining things. Sorry if it didn't make sense. Maybe if you find some way to contact me on aops, I could try and help). (For instance, I could see possible confusion at the part where I claim that the minimum lines be . You might think, "Oh why not , or even or even subtract ?" Well if you actually start off with the fact that there should be at MOST segments from each vertex, then it is obvious, since then there must be a minimum of segments from each vertex).
~th1nq3r
Solution 5
We can see that , since we are choosing 2 integers , and order doesn't matter because and aren't both in the set. Then from doing a smaller example of , we can note that non-endpoints must have an even number of pairs in in order for one domino's end to match another's beginning. Then, in order to maximize the length we want to minimize the number of dominoes we remove to make all pairs be even (except endpoints). Then we can see that for every two pairs with an odd number of pairs, we can connect single ends to form a circular chain (i.e. if we want to ensure that 2,3 have even pairs then we can imagine (3,1)(1,2)). Thus we can divide 40 by 4 to get the number of numbers to remove. Thus we need to remove 10 numbers. But each number is connected to another, so we remove 20 dominoes. Thus there are 780-20 = 760 dominoes not including endpoints. Finally, we can add one more domino at the end since it doesn't need to match up with the first of another to make it 761.
See also
1998 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last question | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.