GRE Prep Club Team Member
Joined: 20 Feb 2017
Posts: 2508
Given Kudos: 1053
GPA: 3.39
Re: If n is a positive integer and the product of all integers from 1 to n
[#permalink]
27 Feb 2023, 02:15
To solve this problem, we need to consider the prime factorization of 990, which is 2 × 3^2 × 5 × 11. The product of all integers from 1 to n can be written as n!, the factorial of n. To ensure that n! is a multiple of 990, n! must have at least one factor of 2, two factors of 3, one factor of 5, and one factor of 11.
The smallest integer that satisfies these conditions is 11, because:
The factors of 2 in 11! are: 2, 4, 6, 8, and 10.
The factors of 3 in 11! are: 3, 6, and 9.
The factors of 5 in 11! are: 5 and 10.
The factors of 11 in 11! is: 11.
Thus, the least possible value of n is 11, and the answer is (B).