Find all prime numbers p such that 2p−1 and 4p+1 are prime numbers, too.
Solutions — 2
Solution 1
Let q=2p−1 and r=4p+1; then p=4r−1 and q=24r−2=2r−1. Consider all remainders that can be left when r is divided by 3: * If r≡1(mod3) then 4r−1≡0(mod3), i.e., 4r−1 is divisible by 3. Thus p=3. But then r=1 which is not a prime. * If r≡2(mod3) then 2r−1≡0(mod3), i.e., 2r−1 is divisible by 3. Thus q=3, whence r=2 and p=7. All three are primes indeed. * If r≡0(mod3), i.e., r is divisible by 3, then r=3. Thus q=5 and p=11 which are primes, too. Consequently, p can be either 7 or 11.
Solution 2
Out of three consecutive integers p−1, p, p+1 one is divisible by 3. Division by 2 or 4 does not change divisibility by 3 since 2 and 4 are coprime with 3. Thus also out of integers p, 2p−1, 4p+1 one is divisible by 3. If these integers are prime, the one divisible by 3 must be 3. Consider all possible cases: * If p=3 then 2p−1=1 but 1 is not prime. * If 2p−1=3 then p=7 and 4p+1=2. All three are primes indeed. * If 4p+1=3 then p=11 and 2p−1=5. All three are primes indeed. Consequently, p can be either 7 or 11.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.