For a shorter explanation:
There are x high-level officials (where x is a positive integer). Each high-level official supervises x^2 mid-level officials, each of whom, in turn, supervises x^3 low-level officials. How many high-level officials are there?
(1) There are fewer than 60 low-level officials.
(2) No official is supervised by more than one person.
Solution:
Assuming that no official is supervised by more than one person:
# of HL officials = x (from the given)
# of ML officials = x(x^2) = x^3 (by the fundamental counting principle or, by conversion (x^2 ML per HL)(no. of HL) = total ML )
# of LL officials: = x^3(x^3) = x^6 (by the fundamental counting principle or, by conversion (x^3 LL per ML)(no. of ML) = total HL )
(1) We do not know whether one official can supervise more than 1 person. If at least 1 official can supervise more than 1 person, our equations cannot hold because the total number of HL, ML, or LL will be lower and we cannot determine this by with the current information given.
(2) The statement is useless by itself.
(1) and (2). Since no official is supervised by more than one person, we can use our equations, particularly, the one for the # of LL:
# of LL = x^6 < 60
Since x is an integer, the only x that can make the equation true is when x = 1.
Therefore, the answer is C.
There are x high-level officials (where x is a positive integer). Each high-level official supervises x^2 mid-level officials, each of whom, in turn, supervises x^3 low-level officials. How many high-level officials are there?
(1) There are fewer than 60 low-level officials.
(2) No official is supervised by more than one person.
Solution:
Assuming that no official is supervised by more than one person:
# of HL officials = x (from the given)
# of ML officials = x(x^2) = x^3 (by the fundamental counting principle or, by conversion (x^2 ML per HL)(no. of HL) = total ML )
# of LL officials: = x^3(x^3) = x^6 (by the fundamental counting principle or, by conversion (x^3 LL per ML)(no. of ML) = total HL )
(1) We do not know whether one official can supervise more than 1 person. If at least 1 official can supervise more than 1 person, our equations cannot hold because the total number of HL, ML, or LL will be lower and we cannot determine this by with the current information given.
(2) The statement is useless by itself.
(1) and (2). Since no official is supervised by more than one person, we can use our equations, particularly, the one for the # of LL:
# of LL = x^6 < 60
Since x is an integer, the only x that can make the equation true is when x = 1.
Therefore, the answer is C.
















