Last visit was: 28 Apr 2024, 13:44 It is currently 28 Apr 2024, 13:44

Close
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

we will pick new questions that match your level based on your Timer History

Track
Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Close
Request Expert Reply
Confirm Cancel
SORT BY:
Date
Tags:
Show Tags
Hide Tags
Math Expert
Joined: 02 Sep 2009
Posts: 92977
Own Kudos [?]: 619703 [1]
Given Kudos: 81613
Send PM
GMAT Club Legend
GMAT Club Legend
Joined: 08 Jul 2010
Status:GMAT/GRE Tutor l Admission Consultant l On-Demand Course creator
Posts: 5969
Own Kudos [?]: 13399 [1]
Given Kudos: 124
Location: India
GMAT: QUANT+DI EXPERT
Schools: IIM (A) ISB '24
GMAT 1: 750 Q51 V41
WE:Education (Education)
Send PM
User avatar
Manager
Manager
Joined: 13 May 2011
Posts: 170
Own Kudos [?]: 180 [2]
Given Kudos: 93
Concentration: Strategy, Technology
GMAT 1: 750 Q49 V42
GPA: 3.2
WE:Accounting (Consulting)
Send PM
Math Expert
Joined: 02 Sep 2009
Posts: 92977
Own Kudos [?]: 619703 [0]
Given Kudos: 81613
Send PM
Re: In 2003, a then-nascent Internet search engine developed an indexing a [#permalink]
Expert Reply
Bunuel wrote:
In 2003, a then-nascent Internet search engine developed an indexing algorithm called G-Cache that retrieved and stored X million webpages per hour. At the same time, a competitor developed an indexing algorithm called HTML-Compress that indexed and stored Y million pages per hour. If both algorithms indexed a positive number of pages per hour, was the number of pages indexed per hour by G-Cache greater than three times the number of pages indexed by HTML-Compress?

(1) On a per-hour basis in 2003, G-Cache indexed 1 million more pages than HTML-Compress indexed
(2) HTML-Compress can index between 400,000 and 1.4 million pages per hour


Source: Platinum GMAT
Kudos for a correct solution.


Platinum GMAT Official Solution:

Translate the final sentence, which contains the question, into algebra:
"the number of pages indexed per hour by G-Cache" = X
"greater than three times" translates into: >3
"the number of pages indexed by HTML-Compress" = Y

Putting this together:
Was X > 3Y?

Evaluate Statement (1) alone.

Translate the information from Statement (1) into algebra:
X - Y = 1 million

Since the original question states that "both algorithms indexed a positive number of pages per hour", the following inequalities must hold true:
X > 0
Y > 0

Simply knowing that X - Y = 1 million does not provide enough information to determine whether X > 3Y.
This can be seen via an algebraic substitution or by trying different numbers.

Trying Numbers
Let X = 10 and, therefore, Y = 9
10 is NOT > 3(9)
But, let X = 1.1 and, therefore, Y = .1
1.1 IS > 3(.1)

Algebraic Substitution
X - Y = 1 million
X = Y + 1 million
Plug this into the inequality we are trying to solve for:
Was X > 3Y?
Was (Y + 1 million) > 3Y?
Was 1 million > 2Y?
Was 500,000 > Y?
Was Y < 500,000?

Simply knowing thatX - Y = 1 million does not provide enough information to determine whether Y < 500,000

Since different legitimate values of Y produce different answers to the question of whether X > 3Y, Statement (1) is not sufficient.

Statement (1) is NOT SUFFICIENT.

Evaluate Statement (2) alone.

Translate the information from Statement (2) into algebra:
400,000 < Y < 1,400,000

We know nothing about the value of X.
If X were 10 million, the answer to the original question was X > 3Y? would be "yes."
If X were 100,000, the answer to the original question was X > 3Y? would be "no."

Since different legitimate values of X and Y produce different answers to the question of whether X > 3Y, Statement (2) is not sufficient.

Statement (2) is NOT SUFFICIENT.

Evaluate Statements (1) and (2) together.

With the information in Statement (1), we concluded that the original question can be boiled down to:
Is Y < 500,000?

Statement (2) says:
400,000 < Y < 1,400,000

Even when combining Statements (1) and (2), we cannot determine whether Y < 500,000
Y could be 450,000 (in which case X = 1,450,000) or Y could be 650,000 (in which case X = 1,650,000). These two different possible values of X and Y would produce different answers to the question "Was Y < 500,000?" Consequently, we would have different answers to the question "Was X > 3Y?"

Statements (1) and (2), even when taken together, are NOT SUFFICIENT.

Since Statement (1) alone is NOT SUFFICIENT, Statement (2) alone is NOT SUFFICIENT, and Statements (1) and (2), even when taken together, are NOT SUFFICIENT, answer E is correct.
Manager
Manager
Joined: 26 Dec 2012
Posts: 132
Own Kudos [?]: 51 [0]
Given Kudos: 4
Location: United States
Concentration: Technology, Social Entrepreneurship
WE:Information Technology (Computer Software)
Send PM
Re: In 2003, a then-nascent Internet search engine developed an indexing a [#permalink]
Is X>3Y?
1. X=Y+1; not enough information given to find out Y+1 will greater than 3Y; so insufficient
2. Range of Y is given, no information is mentioned about X, so insufficient
Combining 1 & 2, we get :
Y= 400k; X=1400K therefore x>3Y
Y=1.4m; X= 2.4m therefore x<3Y

Hence not sufficient still

Hence answer is E
Thanks,
GMAT Club Bot
Re: In 2003, a then-nascent Internet search engine developed an indexing a [#permalink]
Moderator:
Math Expert
92977 posts

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne