ChaseDream
搜索
返回列表 发新帖
查看: 719|回复: 3
打印 上一主题 下一主题

求解一道GWD数学题

[复制链接]
跳转到指定楼层
楼主
发表于 2011-1-14 18:17:42 | 只看该作者 回帖奖励 |倒序浏览 |阅读模式
How many different 6-letter sequences are there that consist of 1 A, 2 B’s, and 3 C’s ?


A.6
B.60
C.120
D.360
E.720
收藏收藏 收藏收藏
沙发
 楼主| 发表于 2011-1-14 18:19:35 | 只看该作者
The answer is B
but I want to know how to get it ?
板凳
 楼主| 发表于 2011-1-14 18:22:15 | 只看该作者
Is the integer n odd?
(1)      n is divisible by 3.
(2)      2n is divisible by twice as many positive integers as n.
    
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.
地板
 楼主| 发表于 2011-1-14 18:22:59 | 只看该作者
上面题目中 条件(2)2n is divisible by twice as many positive integers as n.怎么解释啊?
您需要登录后才可以回帖 登录 | 立即注册

Mark一下! 看一下! 顶楼主! 感谢分享! 快速回复:

手机版|ChaseDream|GMT+8, 2025-10-10 22:02
京公网安备11010202008513号 京ICP证101109号 京ICP备12012021号

ChaseDream 论坛

© 2003-2025 ChaseDream.com. All Rights Reserved.

返回顶部