GMAT Question of the Day - Daily to your Mailbox; hard ones only

 It is currently 18 Dec 2018, 17:27

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

## Events & Promotions

###### Events & Promotions in December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
• ### Happy Christmas 20% Sale! Math Revolution All-In-One Products!

December 20, 2018

December 20, 2018

10:00 PM PST

11:00 PM PST

This is the most inexpensive and attractive price in the market. Get the course now!
• ### Key Strategies to Master GMAT SC

December 22, 2018

December 22, 2018

07:00 AM PST

09:00 AM PST

Attend this webinar to learn how to leverage Meaning and Logic to solve the most challenging Sentence Correction Questions.

# For a positive inteer n, if p is the product of all the integers from

Author Message
TAGS:

### Hide Tags

Manager
Joined: 01 Nov 2017
Posts: 94
GMAT 1: 700 Q50 V35
GMAT 2: 640 Q49 V28
GMAT 3: 680 Q47 V36
GMAT 4: 700 Q50 V35
For a positive inteer n, if p is the product of all the integers from  [#permalink]

### Show Tags

01 Jul 2018, 01:38
1
00:00

Difficulty:

25% (medium)

Question Stats:

74% (01:30) correct 26% (01:46) wrong based on 62 sessions

### HideShow timer Statistics

For a positive inteer n, if p is the product of all the integers from 1 to n, inclusive, and is divisible by 1,560, what is the least possible value of n?

A. 9

B. 10

C. 11

D. 12

E. 13

I was able to find out that n at least must be a 13 to have a product that is divisible by 1560 but then the question what is the LEAST possible value made me understand that they are asking for the n that is unlikely to get us such number. I was completely lost because all ABCD are correct answers. I just picked the smallest and looked at the answer which indicated the answer as E.

If answer is E, then the question probably should have sounded like "What is the smallest possible value of n"

Alex
Senior Manager
Joined: 04 Aug 2010
Posts: 311
Schools: Dartmouth College
Re: For a positive inteer n, if p is the product of all the integers from  [#permalink]

### Show Tags

01 Jul 2018, 02:34
2
alexlearning17 wrote:
Hi everyone,

I came across the following question from Math Revolution.

For a positive inteer n, if p is the product of all the integers from 1 to n, inclusive, and is divisible by 1,560, what is the least possible value of n?

A. 9

B. 10

C. 11

D. 12

E. 13

$$p = n!$$
$$1560 = 2^3 * 3 * 5 * 13$$

For $$p$$ to be divisible by 1560, $$n!$$ must include 13.
A, B, C and D imply that n! = 9!, 10!, 11! or 12!.
Since none of these options for n! will include 13, eliminate A, B, C and D.

Quote:
I was able to find out that n at least must be a 13 to have a product that is divisible by 1560 but then the question what is the LEAST possible value made me understand that they are asking for the n that is unlikely to get us such number. I was completely lost because all ABCD are correct answers. I just picked the smallest and looked at the answer which indicated the answer as E.

If answer is E, then the question probably should have sounded like "What is the smallest possible value of n"

Alex

least possible value is common wording and conveys the same meaning as smallest possible value.
An OG problem that asks for the least possible value:
https://gmatclub.com/forum/if-y-is-an-i ... 39867.html
_________________

GMAT and GRE Tutor
Over 1800 followers
GMATGuruNY@gmail.com
New York, NY
If you find one of my posts helpful, please take a moment to click on the "Kudos" icon.
Available for tutoring in NYC and long-distance.

Manager
Joined: 28 Jul 2016
Posts: 134
Re: For a positive inteer n, if p is the product of all the integers from  [#permalink]

### Show Tags

01 Jul 2018, 07:15
$$1560 = 2^3*3^1*5^1*13^1$$
That means that p should include all primes mentioned above
P should be >= 13 to satisfy equation above

Manager
Joined: 01 Nov 2017
Posts: 94
GMAT 1: 700 Q50 V35
GMAT 2: 640 Q49 V28
GMAT 3: 680 Q47 V36
GMAT 4: 700 Q50 V35
Re: For a positive inteer n, if p is the product of all the integers from  [#permalink]

### Show Tags

02 Jul 2018, 01:30
Yeah, I completely understand how to do the question. The only problem I had is "least" vs "smallest"... that's weird when they consider these two words to be the same.
Re: For a positive inteer n, if p is the product of all the integers from &nbs [#permalink] 02 Jul 2018, 01:30
Display posts from previous: Sort by

# For a positive inteer n, if p is the product of all the integers from

 Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.