-
CSASHISHPANDAY
- Senior | Next Rank: 100 Posts
- Posts: 84
- Joined: Sat Jun 18, 2011 9:50 pm
- Location: New Delhi
- Thanked: 35 times
- Followed by:3 members
- GMAT Score:800
A national park is printing a chart that lists the shortest hiking distance from each of its trailheads to each of its other trailheads. If each pair of trailheads, regardless of order, is represented by exactly one entry in the chart, how many trailheads are in the park?
(1) The number of entries in the chart is greater than the number of trailheads.
(2) There are 10 entries in the chart.
Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
Both statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
EACH statement ALONE is sufficient.
Statements (1) and (2) TOGETHER are NOT SUFFICIENT.
Answer is B
(1) The number of entries in the chart is greater than the number of trailheads.
(2) There are 10 entries in the chart.
Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
Both statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
EACH statement ALONE is sufficient.
Statements (1) and (2) TOGETHER are NOT SUFFICIENT.
Answer is B
