Solution 1
n+23(n+3)(n2+9)∈Z
⇒n+23(n+2+1)(n2+9)∈Z
⇒n+23(n+2)(n2+9)+3(n2+9)∈Z
⇒3(n2+9)+n+23(n2+9)∈Z
⇒n+23(n2−4+13)∈Z
⇒n+23(n+2)(n−2)+39∈Z
⇒3(n−2)+n+239∈Z
⇒n+239∈Z
Since n+2 is positive, the positive factors of 39 are 1, 3, 13, and 39.
Therefore, n=−1, 1, 11 and 37.
Since n is positive, n=1, 11 and 37.
1+11+37=049 is the correct answer
~Tonyttian
~ Edited by aoum
Solution 2
We observe that n+2 and n+3 share no common prime factor, so n+2 divides 3(n+3)(n2+9) if and only if n+2 divides 3(n2+9).
By dividing n+23(n2+9) either with long division or synthetic division, one obtains 3n−6+n+239. This quantity is an integer if and only if n+239 is an integer, so n+2 must be a factor of 39. As in Solution 1, n∈{1,11,37} and the sum is 049.
~scrabbler94
NOTE: If you don't observe that it divides if and only if $n+2$ divides $3(n^2+9)$ you can still do synthetic division by expanding $3(n+3)(n^2+9)$ into $3n^3+9n^2+27n+81$ and get the same remainder. -unhappyfarmer
Solution 3 (modular arithmetic)
Let's express the right-hand expression in terms of mod n+2.
3≡3(modn+2).
n+3≡1(modn+2).
n2+9≡13(modn+2) since n2−4≡0(modn+2) with a quotient n−2
3(n+3)(n2+9)≡3(1)(13)(modn+2)≡39(modn+2)
This means 39=(n+2)k(modn+2) where k is some integer.
Note that n+2 is positive, meaning n+2≥3.
n+2 is one of the factors of 39, so n+2=3,13, or 39, so n=1,11, or 37.
The sum of all possible n is 1+11+37=049.
~Sohcahtoa157
Solution 4(Polynomial Remainder Theorem) fast and easy
For n+2 to be a divisor, the remainder needs to be divisible by n+2. Using polynomial remainder theorem, we can plug in −2 to get 39 as our remainder. n+239 is an integer only when n=1,11,37. Hence, the sum of all possible n is 1+11+37=049.
~AncientKarnivore
Video Solution by Mathletes Corner
https://www.youtube.com/watch?v=WYyDe_VyvvQ
~GP102
Video Solutions 2 by SpreadTheMathLove
https://www.youtube.com/watch?v=98hzWL-cUvk&t=6s