Browse · MathNet
PrintArgentina_2018
Argentina 2018 number theory
Problem
Find all natural such that is a prime for all .
Solution
Clearly must be a prime (set ). More exactly is an odd prime because is not a solution. Furthermore must be a power of 2. Indeed suppose that has an odd prime divisor . Note that as is even. Set ; it is clear that . We have
addition, , hence is composite.
The primes and satisfy the conditions. The values of for are the primes ; the values of for are the primes . We show that and are the only solutions by rejecting all with . For numbers of this form consider . This even number is not a power of 2 (powers of 2 greater than 8 cannot differ by 8). Let be an odd prime divisor of . Set : divides . Also as , hence . Then is composite, which completes the proof. The answer is and .
addition, , hence is composite.
The primes and satisfy the conditions. The values of for are the primes ; the values of for are the primes . We show that and are the only solutions by rejecting all with . For numbers of this form consider . This even number is not a power of 2 (powers of 2 greater than 8 cannot differ by 8). Let be an odd prime divisor of . Set : divides . Also as , hence . Then is composite, which completes the proof. The answer is and .
Final answer
a = 3 and a = 7
Techniques
Prime numbersFactorization techniquesPolynomials mod p