Questions about the world of GMAT Math from other sources and general math related questions.
DiwakarV169
Course Students
 
Posts: 3
Joined: Tue Jun 07, 2016 11:03 am
 

Prime factorization

by DiwakarV169 Wed Sep 07, 2016 5:03 am

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?
VijayS816
Students
 
Posts: 1
Joined: Mon Sep 12, 2016 10:13 pm
 

Re: Prime factorization

by VijayS816 Tue Sep 13, 2016 5:21 am

Least Value of N is 11.

990 - 3*3*2*5*11
DiwakarV169
Course Students
 
Posts: 3
Joined: Tue Jun 07, 2016 11:03 am
 

Re: Prime factorization

by DiwakarV169 Tue Sep 13, 2016 9:57 pm

Why is it 11? why is it not 3?
RonPurewal
Students
 
Posts: 19744
Joined: Tue Aug 14, 2007 8:23 am
 

Re: Prime factorization

by RonPurewal Wed Sep 14, 2016 2:45 am

take a look at the problem statement again -- you need the smallest n such that the product of all the integers from 1 to n is divisible by 990.

if n is 3, then this is clearly not true (the product of all the integers from 1 to 3 is just 6, which is definitely not divisible by 990).
RonPurewal
Students
 
Posts: 19744
Joined: Tue Aug 14, 2007 8:23 am
 

Re: Prime factorization

by RonPurewal Wed Sep 14, 2016 2:45 am

in the plainest possible terms, the point is that...
...1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 is NOT divisible by 990,
...1 · 2 · 3 · 4 · 5 · 6 · 7 · 8 · 9 · 10 · 11 IS divisible by 990.

thus the smallest such "n" is 11.