Difference between revisions of "1998 AIME Problems/Problem 15"
(→Solution 3) |
(→Solution 4) |
||
Line 61: | Line 61: | ||
==Solution 4== | ==Solution 4== | ||
Consider the segments joining the vertices of a regular <math>n</math>-gon. For odd <math>n</math>, we see that the number of segments is quite easily <math>\binom{n-1}{2}</math>. This is because every vertex touches every other vertex the same number of times. (<math>\frac{n-1}{2}</math> times to be exact). Hence the answer for odd cases is <math>n\frac{n-1}{2}=\binom{n-1}{2}</math>. (This is because a segment that starts at the first vertex also ends at the first vertex). | Consider the segments joining the vertices of a regular <math>n</math>-gon. For odd <math>n</math>, we see that the number of segments is quite easily <math>\binom{n-1}{2}</math>. This is because every vertex touches every other vertex the same number of times. (<math>\frac{n-1}{2}</math> times to be exact). Hence the answer for odd cases is <math>n\frac{n-1}{2}=\binom{n-1}{2}</math>. (This is because a segment that starts at the first vertex also ends at the first vertex). | ||
− | For even <math>n</math> however, every vertex touches <math>\frac{n-2}{2}</math> vertices. However, one may be motivated to say that the answer (as in the odd case) is <math>n\frac{n-2}{2}</math>. 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 <math>\frac{n-2}{2}</math> other segments touching it. So we have that the final answer is <math>1</math> plus <math>n\frac{n-2}[2}+1</math>. The case for <math>n=40</math>, is <math>761</math>. | + | For even <math>n</math> however, every vertex touches <math>\frac{n-2}{2}</math> vertices. However, one may be motivated to say that the answer (as in the odd case) is <math>n\frac{n-2}{2}</math>. 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 <math>\frac{n-2}{2}</math> other segments touching it. So we have that the final answer is <math>1</math> plus <math>n\frac{n-2}[2}</math>+<math>1</math>. The case for <math>n=40</math>, is <math>761</math>. |
== See also == | == See also == |
Revision as of 08:21, 19 May 2021
Contents
[hide]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 $n\frac{n-2}[2}$ (Error compiling LaTeX. Unknown error_msg)+. The case for , is .
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.