返回题库

AIME 2025 II · 第 2 题

AIME 2025 II — Problem 2

专题
Contest Math
难度
L4
来源
AIME

题目详情

Problem

Find the sum of all positive integers nn such that n+2n + 2 divides the product 3(n+3)(n2+9)3(n + 3)(n^2 + 9).

解析

Solution 1

3(n+3)(n2+9)n+2Z\frac{3(n+3)(n^{2}+9) }{n+2} \in \mathbb{Z} 3(n+2+1)(n2+9)n+2Z\Rightarrow \frac{3(n+2+1)(n^{2}+9) }{n+2} \in \mathbb{Z} 3(n+2)(n2+9)+3(n2+9)n+2Z\Rightarrow \frac{3(n+2)(n^{2}+9) +3(n^{2}+9)}{n+2} \in \mathbb{Z} 3(n2+9)+3(n2+9)n+2Z\Rightarrow 3(n^{2}+9)+\frac{3(n^{2}+9)}{n+2} \in \mathbb{Z} 3(n24+13)n+2Z\Rightarrow \frac{3(n^{2}-4+13)}{n+2} \in \mathbb{Z} 3(n+2)(n2)+39n+2Z\Rightarrow \frac{3(n+2)(n-2)+39}{n+2} \in \mathbb{Z} 3(n2)+39n+2Z\Rightarrow 3(n-2)+\frac{39}{n+2} \in \mathbb{Z} 39n+2Z\Rightarrow \frac{39}{n+2} \in \mathbb{Z}

Since n+2n + 2 is positive, the positive factors of 3939 are 11, 33, 1313, and 3939.

Therefore, n=1n = -1, 11, 1111 and 3737.

Since nn is positive, n=1n = 1, 1111 and 3737.

1+11+37=0491 + 11 + 37 = \boxed{049} is the correct answer

~Tonyttian

~ Edited by aoum

Solution 2

We observe that n+2n+2 and n+3n+3 share no common prime factor, so n+2n+2 divides 3(n+3)(n2+9)3(n+3)(n^2+9) if and only if n+2n+2 divides 3(n2+9)3(n^2+9).

By dividing 3(n2+9)n+2\frac{3(n^2+9)}{n+2} either with long division or synthetic division, one obtains 3n6+39n+23n-6+\frac{39}{n+2}. This quantity is an integer if and only if 39n+2\frac{39}{n+2} is an integer, so n+2n+2 must be a factor of 39. As in Solution 1, n{1,11,37}n \in \{1,11,37\} and the sum is 049\boxed{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+2n + 2.

33(modn+2)3 \equiv 3 \pmod{n + 2}.

n+31(modn+2)n + 3 \equiv 1 \pmod{n + 2}.

n2+913(modn+2)n^2 + 9 \equiv 13 \pmod{n + 2} since n240(modn+2)n^2 - 4 \equiv 0 \pmod{n + 2} with a quotient n2n - 2

3(n+3)(n2+9)3(1)(13)(modn+2)39(modn+2)3(n + 3)(n^2 + 9) \equiv 3(1)(13) \pmod{n + 2} \equiv 39 \pmod{n + 2}

This means 39=(n+2)k(modn+2)39 = (n + 2)k \pmod{n + 2} where k is some integer.

Note that n+2n + 2 is positive, meaning n+23n + 2 \geq 3.

n+2n + 2 is one of the factors of 39, so n+2=3,13,n + 2 = 3, 13, or 3939, so n=1,11,n = 1, 11, or 3737.

The sum of all possible nn is 1+11+37=0491 + 11 + 37 = \boxed{049}.

~Sohcahtoa157

Solution 4(Polynomial Remainder Theorem) fast and easy

For n+2n+2 to be a divisor, the remainder needs to be divisible by n+2n+2. Using polynomial remainder theorem, we can plug in 2-2 to get 3939 as our remainder. 39n+2\frac{39}{n+2} is an integer only when n=1,11,37n = 1, 11, 37. Hence, the sum of all possible nn is 1+11+37=0491 + 11 + 37 = \boxed{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