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
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
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.

715+ 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.

Question from GMAT sample test #1 (probably factors etc.)

Expert replies
by paradox » Mon Jul 30, 2007 11:09 pm
Hi all,

I'm a newbie here so I hope this is the right place to post. I wasn't sure how to derive the answer for the following question, and I hope someone here can help:

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

A: 10 11 12 13 14

I know the answer is 11, but how do I get to the answer using an efficient method?

Thanks!
Join the discussion
Source: — Problem Solving |

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

A: 10 11 12 13 14

I know the answer is 11, but how do I get to the answer using an efficient method?

Thanks!
The Bold statement implies n factorial

So n! = kx990 =k x 9x10x11

Hence 11 has to become the least value
Join the discussion

by paradox » Tue Jul 31, 2007 11:34 am
Pardon my ignorance, but how do you know that there are no numbers lower than 11 in the sequence that could be factors of 990?
Join the discussion

by Neo2000 » Tue Jul 31, 2007 5:10 pm
paradox wrote:Pardon my ignorance, but how do you know that there are no numbers lower than 11 in the sequence that could be factors of 990?
There definitely are numbers lower than 990 that will be factors of 990. However the question states that n! is a multiple of 990. Now 990 can be split into 9x10x11 with 11 being the highest prime. Therefore the only way you could get 11 in the product was if it was actually part of n.
Therefore the smalles possible value of n had to be 11
Join the discussion