There are points on a circle with the names . For future reference, let points and refer to the same point for any integer .
Now Hugo enters the game with his big pockets filled with money. He places money with a positive integer value on each point, so that the sum of the value of the money placed on the points equals for every integer with .
Now by coincidence, the value of the money placed on the points equals .
Can you compute now the value of the money Hugo placed on field ? Type its value in the answer field.
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.
This is a very clever and entertaining problem, as one would expect from an ETH student.
Applying the given sum formula . . . = 1 0 0 0 to n and n + 1 , we can conclude that A ( n ) = A ( n + 2 0 ) for all n . Together with the given information that A ( n ) = A ( n + 1 0 8 ) , if follows that A ( n ) = A ( n + 4 ) . Now the sum formula simplifies to A ( 1 ) + A ( 2 ) + A ( 3 ) + A ( 4 ) = 2 0 0 since we are going through the period 5 times. Finally A ( 1 0 0 ) = A ( 4 ) = 2 0 0 − A ( 1 ) − A ( 5 0 ) − A ( 1 9 ) = 1 3 0