Bunuel wrote:

Official Solution:

If \(n\) is a positive integer greater than 1, then \(p(n)\) represents the product of all the prime numbers less than or equal to \(n\). The second smallest prime factor of \(p(12) + 11\) is

A. 2

B. 11

C. 13

D. 17

E. 211

The quantity \(p(12)\) equals the product of all the primes less than or equal to 12. Thus, the number we are looking for is this:

\(2 \times 3 \times 5 \times 7 \times 11 + 11\)

\(= 11 \times (2 \times 3 \times 5 \times 7+1)\) [factor out the 11]

\(= 11 \times (210 + 1)\) [do the arithmetic]

\(= 11 \times 211\)

\(= \text{some large number}\)

We want to keep this number factored, and in fact we need to find its prime factorization. So, we ask: is 211 prime? Well, 211 cannot be divided evenly by 2, 3, 5, or 7, because 211 equals a multiple of all those numbers (210), plus 1. The "plus 1" means that 211 won't be divisible by any of the same factors as 210 (except for 1). Is 211 divisible by 11 or by 13? No, as we can check quickly by long division.

And we only need to check possible prime factors up to the square root of 211 (which is between 14, the square root of 196, and 15, the square root of 225).If there is a pair of factors besides 211 and 1, one of the factors in the pair must be lower than the square root of 211 (and the other factor in the pair would be larger). Since there are no prime factors of 211 less than 14, we know that 211 is prime, and the second smallest prime factor of \(p(12) + 11 = 11 \times 211\) is 211.

Answer: E

Dear

Bunuel, Do you have any example to illustrated the yellow highlight because I have no idea about what the statement is trying to convey.

_________________

"Be challenged at EVERY MOMENT."“Strength doesn’t come from what you can do. It comes from overcoming the things you once thought you couldn’t.”"Each stage of the journey is crucial to attaining new heights of knowledge."Rules for posting in verbal forum | Please DO NOT post short answer in your post!

Advanced Search : https://gmatclub.com/forum/advanced-search/