Quick question. In the sequence below, would consecutive terms not be: 1, 2, -3, 4, 5, -6?
Normally consecutive terms would be: 1,2,3,4,5,... etc, but here we are given negatives:(. This threw off the definition slightly.
Therefore the number of consecutive -ve pairs would be:
2* (-3) = -ve
-4*5 = -ve
5* (-6) = -ve
I get the same answer as you do, but I am just wondering if my approach is correct. As well, if 1, 2, -3, 4, 5, -6 is GMAT's correct definition of consecutive integers, please let me know.
For a finite sequence of non zero numbers, the number of variations in the 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?
The questions basically asks: how many pairs of consecutive terms are there in the sequence such that the product of these consecutive terms is negative.
So there are 3 pairs of consecutive terms.
Hope it's clear.