Problem

2012 AIME I Problem 7

At each of the sixteen circles in the network below stands a student. A total of 3360 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]

Leading zeroes must be inputted, so if your answer is 34, then input 034


Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.


Show/Hide Problem Tags

Problem Tags: No tags

Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)