Overall, there can be 31 minuses. Tus, it is
A certain league has two divisions. The respective divisions had 7 and 9 teams qualify for the playoffs. Each division held its own double-elimination tournament -- where a team is eliminated from the tournament upon losing two games -- in order to determine its champion. The four division champions then played in a single-elimination tournament -- where a team is eliminated upon losing one game -- in order to determine the overall league champion. Assuming that there were no ties and no forfeits, what is the maximum number of games that could have been played in order to determine the overall league champion?
Options:
(A)  30
(B)  31
(C)  34
(D)  36
(E)  38
(B)

|33 - 5n| represents the distance between 33 and 5n on the number line. Now, the distance will be minimized when 5n, which is multiple of 5, is closest to 33. Multiple of 5 which is closest to 33 is 35 (for n = 7), so the least distance is 2: |33 - 35| = 2.
If n is an integer, then the least possible value of |33 - 5n| is?
Options:
(A) 0
(B) 1
(C) 2
(D) 3
(E) 4
(C)

10 * 162 = 1620
3 * 100 + 5 * 150 = 1050
1620 – 1050 = 570

A man purchased 3 blankets @ Rs.100 each, 5 blankets @ Rs.150 each and two blankets at a certain rate which is now slipped off from his memory. But he remembers that the average price of the blankets was Rs.162. Find the unknown rate of two blankets?
Options:
(A) 420
(B) 550
(C) 490
(D) 570
(E) 457
(D)