Difference between revisions of "2012 AIME I Problems/Problem 7"
(→Solution 3) |
(→Solution 1) |
||
Line 47: | Line 47: | ||
Solving these equations, we see that <math>\frac{a}{5} = \frac{b}{3} = \frac{c}{4}.</math> Also, the total number of coins is <math>a + 5b + 10c = 3360,</math> so <math>a + 5 \cdot \frac{3a}{5} + 10 \cdot \frac{4a}{5} = 3360 \rightarrow a = \frac{3360}{12} = \boxed{280}.</math> | Solving these equations, we see that <math>\frac{a}{5} = \frac{b}{3} = \frac{c}{4}.</math> Also, the total number of coins is <math>a + 5b + 10c = 3360,</math> so <math>a + 5 \cdot \frac{3a}{5} + 10 \cdot \frac{4a}{5} = 3360 \rightarrow a = \frac{3360}{12} = \boxed{280}.</math> | ||
+ | |||
+ | *One way to make this more rigorous (answering the concern in Solution 3) is to let <math>a</math>, <math>b</math>, and <math>c</math> represent the <math>total</math> number of coins in the rings. Then, you don't care about individual people in the passing, you just know that each ring gets some coins and loses some coins, which must cancel each other out. | ||
===Solution 2=== | ===Solution 2=== |
Revision as of 13:10, 4 March 2018
Problem 7
At each of the sixteen circles in the network below stands a student. A total of coins are distributed among the sixteen students. All at once, all students give away all their coins by passing an equal number of coins to each of their neighbors in the network. After the trade, all students have the same number of coins as they started with. Find the number of coins the student standing at the center circle had originally.
![[asy] import cse5; unitsize(6mm); defaultpen(linewidth(.8pt)); dotfactor = 8; pathpen=black; pair A = (0,0); pair B = 2*dir(54), C = 2*dir(126), D = 2*dir(198), E = 2*dir(270), F = 2*dir(342); pair G = 3.6*dir(18), H = 3.6*dir(90), I = 3.6*dir(162), J = 3.6*dir(234), K = 3.6*dir(306); pair M = 6.4*dir(54), N = 6.4*dir(126), O = 6.4*dir(198), P = 6.4*dir(270), L = 6.4*dir(342); pair[] dotted = {A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P}; D(A--B--H--M); D(A--C--H--N); D(A--F--G--L); D(A--E--K--P); D(A--D--J--O); D(B--G--M); D(F--K--L); D(E--J--P); D(O--I--D); D(C--I--N); D(L--M--N--O--P--L); dot(dotted); [/asy]](http://latex.artofproblemsolving.com/3/3/a/33abde80848746d240bfc392b8997b80cf3bccd5.png)
Solutions
Solution 1
Say the student in the center starts out with coins, the students neighboring the center student each start with
coins, and all other students start out with
coins. Then the
-coin student has five neighbors, all the
-coin students have three neighbors, and all the
-coin students have four neighbors.
Now in order for each student's number of coins to remain equal after the trade, the number of coins given by each student must be equal to the number received, and thus
Solving these equations, we see that Also, the total number of coins is
so
- One way to make this more rigorous (answering the concern in Solution 3) is to let
,
, and
represent the
number of coins in the rings. Then, you don't care about individual people in the passing, you just know that each ring gets some coins and loses some coins, which must cancel each other out.
Solution 2
Since the students give the same number of gifts of coins as they receive and still end up the same number of coins, we can assume that every gift of coins has the same number of coins. Let be the number of coins in each gift of coins. There
people who give
gifts of coins,
people who give
gifts of coins, and
person who gives
gifts of coins. Thus,
Therefore the answer is
Solution 3
The assumption in Solution 1 (the students neighboring the center student each start with coins, why?) and Solution 2 (every gift of coins has the same number of coins, why?) seems not natural. This is a more strict solution without such assumption.
Mark the number of coins from inside to outside as
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
.
Then, we can get that
Add them, let
,
, then
,
.
Repeat in the same way, we can get
,
,
,
.
Then, with
,
,
.
See also
2012 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 6 |
Followed by Problem 8 | |
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.