BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

a then-nascent Internet search engine

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
User avatar
GMAT Instructor
Posts: 3650
Joined: Wed Jan 21, 2009 4:27 am
Location: India
Thanked: 267 times
Followed by:80 members
GMAT Score:760

a then-nascent Internet search engine

by sanju09 » Tue Feb 08, 2011 12:17 am
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.



https://www.platinumgmat.com
The mind is everything. What you think you become. -Lord Buddha



Sanjeev K Saxena
Quantitative Instructor
The Princeton Review - Manya Abroad
Lucknow-226001

www.manyagroup.com
Top
Source: — Data Sufficiency |
Legendary Member
Posts: 2326
Joined: Mon Jul 28, 2008 3:54 am
Thanked: 173 times
Followed by:2 members
GMAT Score:710

by gmatmachoman » Tue Feb 08, 2011 12:58 am
sanju09 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.



https://www.platinumgmat.com
prompt asks : Is G >3H

st 1 : G = H +1 ( in millions)

St 2 :

0.4<=H<=1.4

No data about G

Combining:

Case 1 : H = 0.4
then G = 1.4, yes its three times greater than H
case 2 : H =1.4
G = 2.4
Here No, G is not 3 times greater than H.

Inconsistent. Insufficient

Pick E
Top
Legendary Member
Posts: 1337
Joined: Sat Dec 27, 2008 6:29 pm
Thanked: 127 times
Followed by:10 members

by Night reader » Tue Feb 08, 2011 11:00 am
also E, x and y may have varying values and won't satisfy in neither st(1&2) for yes/no
gmatmachoman wrote:
sanju09 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.



https://www.platinumgmat.com
prompt asks : Is G >3H

st 1 : G = H +1 ( in millions)

St 2 :

0.4<=H<=1.4

No data about G

Combining:

Case 1 : H = 0.4
then G = 1.4, yes its three times greater than H
case 2 : H =1.4
G = 2.4
Here No, G is not 3 times greater than H.

Inconsistent. Insufficient

Pick E
Top
Post new topic Post Reply
• Page 1 of 1