Maths Olympiad Prep

Library / /94 of 520

Number theory Difficulty 5.7 AIME, harder Find the answer

Find all ordered pairs (a,b)(a, b) such that aa and bb are integers and 3a+7b3^{a}+7^{b} is a perfect square.

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

Solution

It is obvious that aa and bb must be non-negative.

Suppose that 3a+7b=n23^{a}+7^{b}=n^{2}. We can assume that nn is positive. We first work modulo 4. Since 3a+7b=n23^{a}+7^{b}=n^{2}, it follows that

n2(1)a+(1)b(mod4) n^{2} \equiv (-1)^{a} + (-1)^{b} \quad (\bmod 4)

Since no square can be congruent to 2 modulo 4, it follows that we have either (i) aa is odd and bb is even or (ii) aa is even and bb is odd.

Case (i): Let b=2cb=2c. Then

3a=(n7c)(n+7c). 3^{a} = (n - 7^{c})(n + 7^{c}).

It cannot be the case that 3 divides both n7cn - 7^{c} and n+7cn + 7^{c}. But each of these is a power of 3. It follows that n7c=1n - 7^{c} = 1, and therefore

3a=27c+1. 3^{a} = 2 \cdot 7^{c} + 1.

If c=0c=0, then a=1a=1, and we obtain the solution a=1,b=0a=1, b=0. So suppose that c1c \geq 1. Then 3a1(mod7)3^{a} \equiv 1 (\bmod 7). This is impossible, since the smallest positive value of aa such that 3a1(mod7)3^{a} \equiv 1 (\bmod 7) is given by a=6a=6, and therefore all aa such that 3a1(mod7)3^{a} \equiv 1 (\bmod 7) are even, contradicting the fact that aa is odd.

Case (ii): Let a=2ca=2c. Then

7b=(n3c)(n+3c). 7^{b} = (n - 3^{c})(n + 3^{c}).

Thus each of n3cn - 3^{c} and n+3cn + 3^{c} is a power of 7. Since 7 cannot divide both of these, it follows that n3c=1n - 3^{c} = 1, and therefore

7b=23c+1. 7^{b} = 2 \cdot 3^{c} + 1.

Look first at the case c=1c=1. Then b=1b=1, and we obtain the solution a=2,b=1a=2, b=1. So from now on we may assume that c>1c > 1. Then 7b1(mod9)7^{b} \equiv 1 (\bmod 9). The smallest positive integer bb such that 7b1(mod9)7^{b} \equiv 1 (\bmod 9) is given by b=3b=3. It follows that bb must be a multiple of 3. Let b=3db=3d. Note that dd is odd, so in particular d1d \geq 1.

Let y=7dy = 7^{d}. Then y31=23cy^{3} - 1 = 2 \cdot 3^{c}, and therefore

23c=(y1)(y2+y+1). 2 \cdot 3^{c} = (y - 1)(y^{2} + y + 1).

It follows that y1=23uy - 1 = 2 \cdot 3^{u} for some positive uu, and that y2+y+1=3vy^{2} + y + 1 = 3^{v} for some v2v \geq 2. But since

3y=(y2+y+1)(y1)2, 3y = (y^{2} + y + 1) - (y - 1)^{2},

it follows that 3y3 \mid y, which is impossible since 3(y1)3 \mid (y - 1).

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.