Maths Olympiad Prep

Track / Stage 5 / 150 of 400 #750 of 1964

Problem 750

AIME late
Number theory Difficulty 5.3 Find the answer

Find all integers a,y1a, y \geq 1 such that 32a1+3a+1=7y3^{2a-1} + 3^a + 1 = 7^y.

The source for this one didn't record the answer, so there is nothing to check what you type against. Work it on paper and mark yourself against the solution below.

Next problem →

Official solution

First, (a,y)=(1,1)(a, y)=(1,1) is a solution. We assume therefore that a,y2a, y \geq 2. By looking modulo 9 and using the fact that the order of 7 modulo 9 is 3, we get that y0mod3y \equiv 0 \bmod 3. We are thus looking for pp such that the order of 7 modulo pp is 3. In this case, we must have p731p \mid 7^{3}-1 and we see that p=19p=19 works. Thus, 32a1+3a+11mod193^{2 a-1}+3^{a}+1 \equiv 1 \bmod 19. (Alternatively, we could have directly said that since 3 divides yy, 19 divides 7317^{3}-1 which divides 7y17^{y}-1).

Therefore, 193a1+119 \mid 3^{a-1}+1, so 3a118mod193^{a-1} \equiv 18 \bmod 19. The order of 3 modulo 19 is 18. We deduce that a10mod18a \equiv 10 \bmod 18.

We then look for pp such that the order of 3 modulo pp is 18 or, to simplify, divides 18 if possible. We find that p=7p=7 works (the order of 3 modulo 7 is 6). Modulo 7, we have 319+310+10mod73^{19}+3^{10}+1 \equiv 0 \bmod 7, which is absurd.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.