Deprecated: preg_replace(): The /e modifier is deprecated, use preg_replace_callback instead in /home/formosam/public_html/phpBB3/includes/bbcode.php on line 112

Deprecated: preg_replace(): The /e modifier is deprecated, use preg_replace_callback instead in /home/formosam/public_html/phpBB3/includes/bbcode.php on line 112

Deprecated: preg_replace(): The /e modifier is deprecated, use preg_replace_callback instead in /home/formosam/public_html/phpBB3/includes/bbcode.php on line 112
FormosaMBA 傷心咖啡店 • 查看主题 - [問題]GWD 02-02

[問題]GWD 02-02

關於 Problem Solving 和 Data Sufficiency 的問題都可以在這邊發表

版主: shpassion, Traver0818

[問題]GWD 02-02

帖子chulack » 2006-11-25 13:33

Q2:

If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?


A. 8

B. 9

C. 10

D. 11

E. 12

Answer:D


I'm confused..... :( Why the answer is not (B) 9? Since 990=9*10*11, so I thought 9 should be the least possible value of n.
头像
chulack
新手會員
新手會員
 
帖子: 5
注册: 2006-02-15 16:49

Re: [問題]GWD 02-02

帖子celivia » 2006-11-26 14:19

chulack \$m[1]:Q2:

If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?


A. 8

B. 9

C. 10

D. 11

E. 12

Answer:D


I'm confused..... :( Why the answer is not (B) 9? Since 990=9*10*11, so I thought 9 should be the least possible value of n.

您應該沒看清楚題目
n需要被990整除
也就是說n是9*10*11的倍數
其中11為質數,n至少要等於11,該數才能被990整除
头像
celivia
初級會員
初級會員
 
帖子: 25
注册: 2006-09-27 15:50
地址: 藍星

帖子chulack » 2006-11-26 14:59

oh...I got it. Thank you... ^_^
头像
chulack
新手會員
新手會員
 
帖子: 5
注册: 2006-02-15 16:49


回到 GMAT MATH 考區

在线用户

正在浏览此版面的用户:没有注册用户 和 6 位游客

cron