For a finite sequence of non zero numbers, the number of variations in sign is defined as the number of pairs of consecutive terms of the sequence for which the product of the two consecutive terms is negative. What is the number of variations in sign for the sequence 1, -3, 2, 5, -4, -6 ?
(A) 1 (B) 2 (C) 3 (D) 4 (E) 5
For a certain race, 3 teams were allowed to enter 3 members each. A team earned 6 – n points whenever one of its members finished in nth place, where 1 ≤ n ≤ 5. There were no ties, disqualifications, or withdrawals. If no team earned more than 6 points, what is the least possible score a team could have earned? GMAT Explanation, Video Solution, and Additional Practice!
For a certain race, 3 teams were allowed to enter 3 members each. A team earned 6 – n points whenever one of its members finished in nth place, where 1 ≤ n ≤ 5. There were no ties, disqualifications, or withdrawals. If no team earned more than 6 points, what is the least possible score a team could have earned?
(A) 0 (B) 1 (C) 2 (D) 3 (E) 4
Here's another one from the GMAT Prep Software free tests 1 and 2 so better to wait on this explanation unless you've done those tests already. This is another GMAT puzzle that relies on you being organized. You basically need to make a list of the possibilities keeping track of the constraints with the goal of maximizing the points for two of the teams so the third team has the least possible score. In terms of the zoomed out approach this question reminds of this is other GMAT puzzle: The number 75 can be written as the sum of the squares of 3 different positive integers
Here's the quick solution and we'll go in depth below:
Define the question
What is the least possible score a team could have earned? Ok, so we're aiming for the least for one of the teams. So what does that mean for the other teams? Maximize them!
Let's review our constraints:
-3 teams were allowed to enter 3 members each.
-A team earned 6 – n points whenever one of its members finished in nth place
-1 ≤ n ≤ 5.
-No team earned more than 6 points
-There were no ties, disqualifications, or withdrawals.
So, follow the above rules while trying to maximize 2 of the teams (try for 6 points each) to make the least possible score for the third team.
1st place = 5 points
then Team 1 can only earn 1 more point (no team earned more than 6 points)
5th place = 1 point
That's the max 6 so the last member team 1 needs to finish in a place that earns no points
9th place = 0 points
Team 1 total points = 6
2nd place = 4 points
then Team 2 can only earn 2 more points
4th place = 2 points
That's the max 6 so the last member of team 2 needs to finish in a place that earns no points
8th place = 0 points
Team 2 total points = 6
Team 3 has everything that's left
3rd place = 3 points
5th place = 0 points
6th place = 0 points
Team 3 total points = 3
Video Solution: For a certain race 3 teams were allowed...
Additional GMAT Max/Min Puzzle Example Questions
Two questions from to mind. They're both different from this one and different from each other but share this crucial max/min idea:
When you see a GMAT Exponents question a few things should be coming to mind: The bases, factoring, and special quadratics. In this question you should notice that all of the bases are powers of 2. You might consider getting all of the bases to be the same so that you can do some factoring. Ultimately you want to eliminate the addition so that you can deal with the square root. There's a pretty good chance that something nice is going to happen with the square root considering that all of the answers are integers.
Once you get all of the bases the same you can factor out the smallest one, 2^8. Then all of the exponents in the parenthesis can be resolved. The parenthesis is equal to 289 which is a perfect square. 2^8 is also a perfect square as is any integer raised to an even power. At this point you can deduce that y must be equal to 17 and x to -1. So -1 - 17 = -18. These questions are considered tough but should be your bread and butter!