Maths Olympiad Prep

Library / /6 of 20

, 2022

Number theory Difficulty 7.9 National Olympiad, round 2 Prove it Germany

Problem:

Determine all integers n1n \geq 1 for which there exists a pair (a,b)(a, b) of positive integers with the following properties:

i) No third power of a prime divides a2+b+3a^{2}+b+3.

ii) The equation ab+3b+8a2+b+3=n\frac{a b+3 b+8}{a^{2}+b+3}=n holds.

Solutions — 2

Solution 1

Solution:

Let pp be any prime factor of a2+b+3a^{2}+b+3 (such a factor exists because a2+b+35a^{2}+b+3 \geq 5). Then ba23modpb \equiv -a^{2}-3 \bmod p. Because nn must be an integer, pp must also be a prime factor of ab+3b+8a b+3 b+8. Thus 0ab+3b+8a(a23)+3(a23)+8a33a23a1(a+1)3modp0 \equiv a b+3 b+8 \equiv a\left(-a^{2}-3\right)+3\left(-a^{2}-3\right)+8 \equiv -a^{3}-3 a^{2}-3 a-1 \equiv -(a+1)^{3} \bmod p, so pp must also be a prime factor of a+1a+1. By i), pp can occur in a2+b+3a^{2}+b+3 at most quadratically, hence at most twice as often as in a+1a+1. Since this holds for every prime factor, we obtain a2+b+3(a+1)2a^{2}+b+3 \leq (a+1)^{2}.

If, on the other hand, a prime factor pp occurred in a2+b+3a^{2}+b+3 at most once, then we would have a2+b+3(a+1)2p(a+1)22a^{2}+b+3 \leq \frac{(a+1)^{2}}{p} \leq \frac{(a+1)^{2}}{2}, contradicting (a+1)22a2+1<a2+4a2+b+3\frac{(a+1)^{2}}{2} \leq a^{2}+1 < a^{2}+4 \leq a^{2}+b+3.

Hence we must have a2+b+3=(a+1)2a^{2}+b+3=(a+1)^{2}. Consequently b=2a2b=2 a-2 and thus ab+3b+8=a(2a2)+3(2a2)+8=2a2+4a+2=2(a+1)2a b+3 b+8=a(2 a-2)+3(2 a-2)+8=2 a^{2}+4 a+2=2(a+1)^{2}.

Therefore n=2n=2 is the only possible solution. The example (a,b)=(2,2)(a, b)=(2,2) with a2+b+3=9a^{2}+b+3=9 shows that n=2n=2 is indeed a solution. ㅁ

Solution 2

Solution:

If we solve condition ii) for bb, we obtain b=na2+3n8a+3nb=\frac{n a^{2}+3 n-8}{a+3-n}.

Case 1: n=a+3n=a+3. Here, since bZ+b \in \mathbb{Z}^{+}, the numerator must also vanish, which after substitution gives (a+1)3=0(a+1)^{3}=0, i.e. a=1a=-1 - a contradiction to aZ+a \in \mathbb{Z}^{+}.

Case 2: na+3n \neq a+3. From (1) it follows that
a2+b+3=a2+na2+3n8a+3n+3=a3+3a2na2+na2+3n8+3a+93na+3n=(a+1)3a+3n. a^{2}+b+3=a^{2}+\frac{n a^{2}+3 n-8}{a+3-n}+3=\frac{a^{3}+3 a^{2}-n a^{2}+n a^{2}+3 n-8+3 a+9-3 n}{a+3-n}=\frac{(a+1)^{3}}{a+3-n}.

Now we denote by vp(z)v_{p}(z) the multiplicity with which a prime factor pp occurs in the number zZ+z \in \mathbb{Z}^{+}. If there existed a prime factor pp with vp(a+1)vp(a+3n)+1v_{p}(a+1) \geq v_{p}(a+3-n)+1, then by (2) we would have vp(a2+b+3)2vp(a+3n)+33v_{p}\left(a^{2}+b+3\right) \geq 2 v_{p}(a+3-n)+3 \geq 3, contradicting i). Hence vp(a+1)vp(a+3n)v_{p}(a+1) \leq v_{p}(a+3-n), and thus a+1a+1 divides a+3na+3-n. From (2) it also follows that a+3n>0a+3-n>0 and hence a+1a+3na+1 \leq a+3-n, so n2n \leq 2.

For n=1n=1 we would need a+1a+2a+1 \mid a+2, which holds for no aZ+a \in \mathbb{Z}^{+}. Hence only n=2n=2 can hold, which is confirmed by the example from the first 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: MathNet, licensed CC-BY-4.0. Statement translated into English from de; metadata (topic, difficulty) added by this project.