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).