Counting Solutions

Find the number of positive integers n n for which
1. n 1991 1. n \leq 1991
2.6 2. 6 is a factor of n 2 + 3 n + 2 n^{2}+3n+2


The answer is 1328.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

n 2 + 3 n + 2 = ( n + 1 ) ( n + 2 ) n^{2}+3n+2=(n+1)(n+2) Observe that if n n is not divisible by 3 3 , then we get remainder 1 1 or 2 2 when n n is divided by 3 3 .
\Rightarrow either n + 1 n+1 or n + 2 n+2 is divisible by 3 3 .
6 ( n + 1 ) ( n + 2 ) \Rightarrow 6 \mid (n+1)(n+2)
Since, as ( n + 1 ) ( n + 2 ) (n+1)(n+2) is the product of two consecutive integers, it is also divisible by 2 2 .
Thus, for 6 6 to be a factor of n 2 + 3 n + 2 n^{2}+3n+2 , n n shouldn't be divisible by 3 3 .
In order to find the number of positive integers less than or equal to 1991 1991 , we use the formula 1991 3 \left \lfloor{\frac{1991}{3}}\right \rfloor = 663 =663 Thus, the number of positive integers for which the given conditions hold true are 1991 663 = 1328 1991-663=\boxed{1328}


Actually, if you observe the polynomial carefully, it is even for all n (This can be explained using factorization). Also, since 3n is obviously divisible by 3, so n 2 n^2 must give a remainder of 1 when divided by 3 (this is because 3 n 2 + 2 3|n^2+2 ). Notice that there is no solution for n 2 1 ( m o d 3 ) n^2\equiv 1\pmod 3 if n 3 n|3 , so there are 1991 3 = 663 \lfloor \frac{1991}{3} \rfloor=663 such n's. So, we have 1991-663=1328 that satisfy the given conditions in the problem.

敬全 钟 - 7 years, 1 month ago
Aditya Dhawan
Jan 5, 2016

Moderator note:

Good analysis of this problem.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...