还没有登录哦！
[Data Sufficiency]
试题详情
题目：
S is a set of points in the plane. How many distinct triangles can be drawn that have three of the points in S as vertices?
- The number of distinct points in S is 5.
- No three of the points in S are collinear.
选项:
A、Statement (1) ALONE is sufficient, but statement (2) alone is not sufficient.
B、Statement (2) ALONE is sufficient, but statement (1) alone is not sufficient.
C、BOTH statements TOGETHER are sufficient, but NEITHER statement ALONE is sufficient.
D、EACH statement ALONE is sufficient.
E、Statements (1) and (2) TOGETHER are not sufficient.
答案:
C
提问：
这道题没看懂，求具体的解题思路
解答：
点赞0
阅读1159
提问：
这道题没看懂，求具体的解题思路
解答：
点赞0
阅读1160
问个问题
注册太麻烦？点这里查看免费答疑吧！
博币不足
加"GMAT小百科"小智微信
直接送200
