BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
Live EA class + 6 months of EA OnDemand
  • Expert-led weekly online sessions
  • EA Masterclass access between classes
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

130-point score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

last day queries !! thanks

Expert replies
by desiguy » Tue Jul 22, 2008 4:09 am
If n is a positive integer and the product of all the intergers from 1 to n, inclusive is 990, what is the least possible value of n ?

choice:
10 or 11

Ans: is 11.

My answer is 10 because if the integers are say (1 and 10), it meets the criteria above !!
Join the discussion
Source: — Problem Solving |

by VP_Tatiana » Tue Jul 22, 2008 12:43 pm
I'm not sure I understand the question correctly.

The product of all the numbers from 1 to 6 inclusive is 720, and the product of all the numbers from 1 to 7 inclusive is 5040. So, it does not seem that there exists an n such that the product of the numbers from 1 to n equals 990.

Is there an "answer does not exist" answer choice?

Tatiana
Tatiana Becker | GMAT Instructor | Veritas Prep
Join the discussion

by parallel_chase » Tue Jul 22, 2008 1:40 pm
DUDE you have made the same mistake while re posting the question.

Here is the actual question.

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


If I take you answer which is 10

Then, what the question stem means is 10! is a multiple of 990.

10! = 10*9*8*7*6*5*4*3*2*1=3628800

990 = 9*10*11

I'll rephrase the question for you.

Is 3628800 a multiple of 990?

The answer is no if n = 10, simply because n! which is 10! does not have 11

Now lets look at 11

11! = 11*10*9*8*7*6*5*4*3*2*1
990 =9*10*11

In this case answer is yes 11! is a multiple of 990.

In the test all you have to do is look at the prime factors.

if x is a multiple of y, then x should have all the prime factors of y, but it is not necessary for y to have all the prime factors of x.

I hope this clears everything. Let me know if you still have any doubts.

All the Best.
Join the discussion

Prime factor

by gmatutor » Tue Jul 22, 2008 5:10 pm
Prime factor 990.

990 = 2 X 5 X 3^2 X 11

Since the largest prime factor of 990 is 11, choose 11 it must be the least possible value for n.
Join the discussion

Re: Prime factor

by egybs » Tue Jul 22, 2008 8:33 pm
gmatutor wrote:Prime factor 990.

990 = 2 X 5 X 3^2 X 11

Since the largest prime factor of 990 is 11, choose 11 it must be the least possible value for n.
While, that's right in this case, it isn't universally correct...

For example, if we were doing the same question but for the number 1920:
1920 = 2^7*3*5

In this case, 5 is the largest prime factor, but 5! would not be the appropriate answer.

We'd need to make sure that all of the prime factors are represented so:
2*3*4*5*6*7*8 or 8! would be the right answer.
Join the discussion

by gmatutor » Wed Jul 23, 2008 2:09 pm
Absolutely!

Forgive my imprecise language.
Join the discussion

by egybs » Wed Jul 23, 2008 2:11 pm
You're forgiven! ;-)
Join the discussion