Maths Olympiad Prep

Library / /8 of 520

Number theory Difficulty 4.5 AIME Find the answer

Determine all integers n1n \geqslant 1 for which there exists a pair of positive integers (a,b)(a, b) such that no cube of a prime divides a2+b+3a^{2}+b+3 and
ab+3b+8a2+b+3=n \frac{a b+3 b+8}{a^{2}+b+3}=n

A number or a short expression. Spacing and $ signs are ignored.

Solution

As ba23(moda2+b+3)b \equiv -a^{2}-3\left(\bmod a^{2}+b+3\right), the numerator of the given fraction satisfies
ab+3b+8a(a23)+3(a23)+8(a+1)3(moda2+b+3) a b+3 b+8 \equiv a\left(-a^{2}-3\right)+3\left(-a^{2}-3\right)+8 \equiv -(a+1)^{3} \quad\left(\bmod a^{2}+b+3\right)
As a2+b+3a^{2}+b+3 is not divisible by p3p^{3} for any prime pp, if a2+b+3a^{2}+b+3 divides (a+1)3(a+1)^{3} then it does also divide (a+1)2(a+1)^{2}. Since
0<(a+1)2<2(a2+b+3) 0<(a+1)^{2}<2\left(a^{2}+b+3\right)
we conclude (a+1)2=a2+b+3(a+1)^{2}=a^{2}+b+3. This yields b=2(a1)b=2(a-1) and n=2n=2. The choice (a,b)=(2,2)(a, b)=(2,2) with a2+b+3=9a^{2}+b+3=9 shows that n=2n=2 indeed is a solution.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.