Maths Olympiad Prep

Library / /85 of 520

Number theory Difficulty 6.4 National olympiad Find the answer

Find the smallest prime number that can not be written in the form 2a3b\left| 2^a-3^b \right| with non-negative integers a,ba,b.

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

Solution

1. Identify the problem: We need to find the smallest prime number that cannot be written in the form 2a3b\left| 2^a - 3^b \right| with non-negative integers aa and bb.

2. Check smaller primes: We start by verifying if smaller primes can be written in the form 2a3b\left| 2^a - 3^b \right|.
2=2131,3=2230,5=2331,7=2432,11=3324,13=2431,17=2634,19=2333,23=2532,29=2531,31=2530,37=2633. \begin{aligned} &2 = 2^1 - 3^1, \\ &3 = 2^2 - 3^0, \\ &5 = 2^3 - 3^1, \\ &7 = 2^4 - 3^2, \\ &11 = 3^3 - 2^4, \\ &13 = 2^4 - 3^1, \\ &17 = 2^6 - 3^4, \\ &19 = 2^3 - 3^3, \\ &23 = 2^5 - 3^2, \\ &29 = 2^5 - 3^1, \\ &31 = 2^5 - 3^0, \\ &37 = 2^6 - 3^3. \end{aligned}
All primes less than 41 can be written in the form 2a3b\left| 2^a - 3^b \right|.

3. **Check if 41 can be written in the form 2a3b\left| 2^a - 3^b \right|:
-
Case 1**: 2a3b=412^a - 3^b = 41
2a41+3b(mod8) 2^a \equiv 41 + 3^b \pmod{8}
Since 2a0(mod8)2^a \equiv 0 \pmod{8} for a3a \geq 3, we have:
41+3b0(mod8)    3b1(mod8) 41 + 3^b \equiv 0 \pmod{8} \implies 3^b \equiv -1 \pmod{8}
However, 3b(mod8)3^b \pmod{8} cycles through 1,3,1,3,1, 3, 1, 3, \ldots, so 3b1(mod8)3^b \equiv -1 \pmod{8} has no solutions.

- Case 2: 2a3b=412^a - 3^b = -41
2a41+3b(mod8) 2^a \equiv -41 + 3^b \pmod{8}
Since 2a0(mod8)2^a \equiv 0 \pmod{8} for a3a \geq 3, we have:
41+3b0(mod8)    3b1(mod8) -41 + 3^b \equiv 0 \pmod{8} \implies 3^b \equiv 1 \pmod{8}
This implies bb must be even. Let b=2lb = 2l:
2a=32l+41 2^a = 3^{2l} + 41
Taking modulo 3:
2a1(mod3) 2^a \equiv 1 \pmod{3}
This implies aa must be even. Let a=2ka = 2k:
22k=32l+41 2^{2k} = 3^{2l} + 41
Factoring:
(2k3l)(2k+3l)=41 (2^k - 3^l)(2^k + 3^l) = 41
Since 41 is prime, the only factor pairs are (1,41)(1, 41) and (41,1)(41, 1). This implies:
2k3l=1and2k+3l=41 2^k - 3^l = 1 \quad \text{and} \quad 2^k + 3^l = 41
Solving these:
2k=21and3l=20 2^k = 21 \quad \text{and} \quad 3^l = 20
Neither of these are powers of 2 or 3, so no solutions exist.

Hence, we have exhausted all cases. Thus, the answer is 41\boxed{41}.

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.