Let the number of targets hit be x and number of targets missed be y. Noy for each archer, there is a different combination of x and y but 2 constraints remain the same.
1. Since each x adds 1 point, each y reduces 1/3 points and the total of these for every archer is 36, we have equation 1x-(y/3) = 36 or 3x-y=108 (
eq1). The value of x and y will be different for each archer will be different, but the sum of the points cannot exceed 108 in the above equation
2. There were 180 targets and hence x+y have to be <=180 (
ineq2).
With this info, we need to identify the minimum of value of x and y which satisfies both the conditions.
If I take x<36, y will turn negative. Let's take an example. x=35, then 3(35)-y = 108, -y = 108-105, -y=3 or y=-3 which is not possible
Hence, the minimum value of x, where y is at least 0, is 36 (in effect an archer who has hit 36 targets and then kind of stopped)
With each increment of 1 in x, for the eq1 to hold true, y will increase by 3.
However, the maximum value of x can be 72, where y will be 108 (thus x+y = 180) and 3(72)-108 = 36
If x increases beyond 72, ineq2 will be breached. So, count of all possible values of x = 72-36+1 =
37