Events & Promotions
|
|
GMAT Club Daily Prep
Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized
for You
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
08 Apr 2015, 05:27
Kudos
Bookmarks
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
95%
(hard)
Question Stats:
23% (01:40) correct
77%
(01:42)
wrong
based on 342
sessions
History
Date
Time
Result
Not Attempted Yet
25 integers are written on a board. Are there at least two consecutive integers among them?
(1) For every value in the list, if the value is increased by 1, the number of distinct values in the list does not change.
(2) At least one value occurs more than once in the list.
(1) For every value in the list, if the value is increased by 1, the number of distinct values in the list does not change.
(2) At least one value occurs more than once in the list.
13 Apr 2015, 06:00
Kudos
Bookmarks
Bunuel
Let’s first review the information given to us here:
25 integers are written on the board – we don’t know whether they are all distinct. We want to know if there is any pair of consecutive integers among them.
Let’s look at the statements:
Statement 1: For every value in the list, if the value is increased by 1, the number of distinct values in the list does not change.
It is easy to fall for statement 1 and think that it is sufficient alone. Say, if any single value is increased by 1 and it doesn’t match any other value already there in the list, it means that there are no consecutive integers, doesn’t it? Well, no! But we will talk about that in a minute. Let’s first look at why we might think that statement 1 is sufficient.
Say, the numbers are: 1, 5, 8, 10, 35, 76 …
If you increase 1 by 1, you get 2 and the list looks like this:
Now the numbers are 2, 5, 8, 10, 35, 76 …
Note that the number of distinct integers is the same.
Had there been two consecutive integers such as 1, 2, 8, 10, 35, 76 …
If we increase 1 by 1, the list would have become 2, 2, 8, 10, 35, 76 … – this would have decreased the number of distinct integers.
You might be tempted to say here that statement 1 alone is sufficient. What you might forget is that when you increase a number by 1, one distinct integer could be getting wiped out and another taking its place! It may not occur to you that the case might be different when one value occurs more than once, but statement 2 should give you a hint. Obviously, statement 2 alone is not sufficient but let’s analyze what happens when we take both statements together.
Since statement 1 doesn’t tell you that all values are distinct, statement 2 should make you think that you need to consider the case where one value occurs more than once in the list. In that case, is it possible that number of different values in the list does not change even though there is a pair of consecutive integers?
Say the numbers are 1, 1, 2, 8, 10, 35, 76 …
Now if you increase 1 by 1, the list would look like 1, 2, 2, 8, 10, 35, 76 …
Here, the number of distinct integers stays the same even when you increase a number by 1 and you have consecutive integers! In this case, if there were no consecutive integers, the number of distinct integers would have increased. Hence if the numbers are not all distinct and the number of distinct numbers needs to stay the same, there must be a pair of consecutive integers.
This tells you that statement 1 is not sufficient alone but both statements together answer the question with a ‘Yes’.
Answer (C)
Takeaway – Just as when you get an easy (C), you must check whether the answer could be (A) or (B), when you feel that the answer is an easy (A) or (B), you might want to check whether the other statement gives some relevant data and is necessary.
General Discussion
08 Apr 2015, 05:40
Kudos
Bookmarks
Let's reduce the set to 4 integers.
If the set has values - 2,3,4.
No of distinct values are 3
If the values are - 2,2,2.
No of district values is 1.
With statement A, those integers wil just move one place ahead but not give a clear answer whether there are consecutive nos in the set or not.
So, A is insufficient.
For B,
It is certainly not sufficient on its own since having two same integers in the set doesn't reflect on the other integers.
Insufficient.
Combining them,
Both the cases mentioned above are still valid. Thus, answer is E.
Posted from GMAT ToolKit
If the set has values - 2,3,4.
No of distinct values are 3
If the values are - 2,2,2.
No of district values is 1.
With statement A, those integers wil just move one place ahead but not give a clear answer whether there are consecutive nos in the set or not.
So, A is insufficient.
For B,
It is certainly not sufficient on its own since having two same integers in the set doesn't reflect on the other integers.
Insufficient.
Combining them,
Both the cases mentioned above are still valid. Thus, answer is E.
Posted from GMAT ToolKit 
