In the anime Psycho Pass , the crime coefficient is an index used to gauge a person's tendency of committing crimes. The index is recorded as a non-zero integer.
Inspectors from the Public Safety's Bureau actively hunt down citizens with a crime coefficient of over 100 since this indicates a high likelihood of committing crimes. To do so, they rely on the Dominator, a gun-like tool capable of reading a person's mental state and gauging their intent of committing crimes. To targets with a crime coefficient of over 100 but not exceeding 300, an energy burst which paralyzes the target is fired while for targets with crime coefficients exceeding 300, the target is exterminated.
All was well and good order was maintained in the society until the emergence of Shogo Makishima, a criminally asymptomatic individual. Such individuals are free to vary their crime coefficient by will, therefore rendering the Dominator obsolete. (Imagine robbing a bank and having the Dominator cries: Crime coefficient: 0. Not a target for enforcement action! )
With Makishima on the loose and wrecking havoc as he pleased, the Public Safety Bureau came up with an alternative strategy. They successfully altered the Dominator so that it was able to compute a new "fluctuation coefficient". The fluctuation coefficient equaled the average of sum of all differences in crime coefficients between successive encounters. The Dominator was programmed specifically to exterminate Makishima (it won't work on ordinary citizens) if the "fluctuation coefficient" exceeded a certain positive real number .
To illustrate this, suppose that for a law-abiding citizen, the Dominator records crime coefficients of in separate encounters. On the fourth encounter, if the citizen has a crime coefficient of 15, the three differences between the four successive encounters would be and the average of the sum (so-called "fluctuation coefficient") would be .
The Public Safety's Bureau had 7 previous encounters with Makishima. Makishima's crime coefficients on the seven encounters were recorded as: , where is an unknown non-negative integer.
The Public Safety Bureau is determined to exterminate Makishima on the encounter, no matter what it takes. What is the maximum allowed to be programmed into the Dominator to ensure a successful extermination?
Submit your answer to 2 decimal places.
——————————————————————————————
This question is part of the problem set Mathematics in Anime
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.
Let Makishima’s crime coefficient on the 8 th encounter be y and denote f ( x , y ) as the fluctuation coefficient.
Note that f ( x , y ) = 7 ∣ 1 0 0 − x ∣ + ∣ 1 0 0 − 2 x ∣ + ∣ 1 2 0 − 2 x ∣ + ∣ 1 2 0 − 3 x ∣ + ∣ 1 8 − 3 x ∣ + ∣ 1 8 − 3 x ∣ + ∣ 3 x − y ∣ . We can rephrase the question as “find maximum K such that f ( x , y ) ≥ K .”
Since ∣ 3 x − y ∣ is non-negative, f ( x , y ) is minimized only when y = 3 x . Therefore, we are now seeking to minimize g ( x ) = f ( x , 3 x ) .
Note that g ( x ) = 7 ∣ 1 0 0 − x ∣ + 2 ∣ 5 0 − x ∣ + 2 ∣ 6 0 − x ∣ + 3 ∣ 4 0 − x ∣ + 6 ∣ 6 − x ∣ .
For 0 ≤ x ≤ 6 , we have
g ( x ) = 7 1 0 0 − x + 2 ( 5 0 − x ) + 2 ( 6 0 − x ) + 3 ( 4 0 − x ) + 6 ( 6 − x ) = 7 4 7 6 − 1 4 x . The minimum of this function is attained when x = 6 . A quick computation reveals that g ( 6 ) = 5 6 .
For 7 ≤ x ≤ 4 0 , we have
g ( x ) = 7 1 0 0 − x + 2 ( 5 0 − x ) + 2 ( 6 0 − x ) + 3 ( 4 0 − x ) + 6 ( x − 6 ) = 7 4 0 4 − 2 x . The minimum of this function is attained when x = 4 0 . A quick computation reveals that g ( 4 0 ) = 4 6 . 2 8 5 7 .
For 4 1 ≤ x ≤ 5 0 , we have
g ( x ) = 7 1 0 0 − x + 2 ( 5 0 − x ) + 2 ( 6 0 − x ) + 3 ( x − 4 0 ) + 6 ( x − 6 ) = 7 1 6 4 + 4 x . The minimum of this function is attained when x = 4 1 . A quick computation reveals that g ( 4 1 ) = 4 6 . 8 5 7 1 .
For 5 1 ≤ x ≤ 6 0 , we have
g ( x ) = 7 1 0 0 − x + 2 ( x − 5 0 ) + 2 ( 6 0 − x ) + 3 ( x − 4 0 ) + 6 ( x − 6 ) = 7 8 x − 3 6 . The minimum of this function is attained when x = 5 1 . A quick computation reveals that g ( 5 1 ) = 5 3 . 1 4 2 9 .
For 6 1 ≤ x ≤ 1 0 0 , we have
g ( x ) = 7 1 0 0 − x + 2 ( x − 5 0 ) + 2 ( x − 6 0 ) + 3 ( x − 4 0 ) + 6 ( x − 6 ) = 7 1 2 x − 2 7 6 . The minimum of this function is attained when x = 6 1 . A quick computation reveals that g ( 6 1 ) = 6 5 . 1 4 2 9 .
For x ≥ 1 0 1 , we have
g ( x ) = 7 x − 1 0 0 + 2 ( x − 5 0 ) + 2 ( x − 6 0 ) + 3 ( x − 4 0 ) + 6 ( x − 6 ) = 7 1 4 x − 4 7 6 . The minimum of this function is attained when x = 1 0 1 . A quick computation reveals that g ( 1 0 1 ) = 1 3 4 .
Therefore, the maximum permissible K is 4 6 . 2 8 5 7 ≈ 4 6 . 2 9 , attained when x = 4 0 , y = 1 2 0 .