If n is a positive integer and the product of all the integers from 1 to n, inclusive, is multiple of 990, what is the least value of n?
A. 10
B. 11
C. 12
D. 13
E. 14
A. 10
B. 11
C. 12
D. 13
E. 14
BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course
RedeemTarget Test Prep · GMAT
Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

with Chris Peckover, 100th-Percentile GMAT Scorer
Self-paced EA prep. Study on your schedule.

with Logan Thompson
Complete access from day one. Study on your schedule.
Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.
The product of all the integers 1 to n is n!. We need the smallest integer value of n such that n! will be divisible by 990.sugmomo wrote:If n is a positive integer and the product of all the integers from 1 to n, inclusive, is multiple of 990, what is the least value of n?
A. 10
B. 11
C. 12
D. 13
E. 14
the answer will be Bsugmomo wrote:If n is a positive integer and the product of all the integers from 1 to n, inclusive, is multiple of 990, what is the least value of n?
A. 10
B. 11
C. 12
D. 13
E. 14
New here Create free account