Number theoryDifficulty 6.4National olympiadFind the answer
Find the smallest prime number that can not be written in the form 2a−3b with non-negative integers a,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 2a−3b with non-negative integers a and b.
2. Check smaller primes: We start by verifying if smaller primes can be written in the form 2a−3b. 2=21−31,3=22−30,5=23−31,7=24−32,11=33−24,13=24−31,17=26−34,19=23−33,23=25−32,29=25−31,31=25−30,37=26−33. All primes less than 41 can be written in the form 2a−3b.
3. **Check if 41 can be written in the form 2a−3b: - Case 1**: 2a−3b=41 2a≡41+3b(mod8) Since 2a≡0(mod8) for a≥3, we have: 41+3b≡0(mod8)⟹3b≡−1(mod8) However, 3b(mod8) cycles through 1,3,1,3,…, so 3b≡−1(mod8) has no solutions.
- Case 2: 2a−3b=−41 2a≡−41+3b(mod8) Since 2a≡0(mod8) for a≥3, we have: −41+3b≡0(mod8)⟹3b≡1(mod8) This implies b must be even. Let b=2l: 2a=32l+41 Taking modulo 3: 2a≡1(mod3) This implies a must be even. Let a=2k: 22k=32l+41 Factoring: (2k−3l)(2k+3l)=41 Since 41 is prime, the only factor pairs are (1,41) and (41,1). This implies: 2k−3l=1and2k+3l=41 Solving these: 2k=21and3l=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.
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.