Browse · MathNet
PrintCzech Republic
Czech Republic number theory
Problem
We say that a positive integer is fantastic, if there exist positive rational numbers and such that
a. Prove that there exist infinitely many prime numbers such that no multiple of is fantastic. b. Prove that there exist infinitely many prime numbers such that some multiple of is fantastic.
a. Prove that there exist infinitely many prime numbers such that no multiple of is fantastic. b. Prove that there exist infinitely many prime numbers such that some multiple of is fantastic.
Solution
Note that We put and , where and are positive integers such that both and and also and are coprime. Then we get , whence the Diophantine equation
has to be investigated. Now . Therefore, (6) implies . As we get similarly , too, we infer
and (6) becomes
Therefore, has to divide either or . In the case , i.e. when is a quadratic non-residue mod , this means that divides (and or ). But since the same argument is valid for instead of , we have contradicting the coprimality of and . Thus the infinitely many primes with have no fantastic multiple and part (a) is solved.
For part (b) we choose and substitute . Thus we are looking for integers and such that
Here we choose , and use the identity to obtain i.e. . Therefore every prime factor of the Fibonacci number has a fantastic multiple.
In view of the well-known formula it is clear that and are relatively prime, if and are different prime numbers. Hence we know that infinitely many prime numbers have a fantastic multiple, which solves part (b).
has to be investigated. Now . Therefore, (6) implies . As we get similarly , too, we infer
and (6) becomes
Therefore, has to divide either or . In the case , i.e. when is a quadratic non-residue mod , this means that divides (and or ). But since the same argument is valid for instead of , we have contradicting the coprimality of and . Thus the infinitely many primes with have no fantastic multiple and part (a) is solved.
For part (b) we choose and substitute . Thus we are looking for integers and such that
Here we choose , and use the identity to obtain i.e. . Therefore every prime factor of the Fibonacci number has a fantastic multiple.
In view of the well-known formula it is clear that and are relatively prime, if and are different prime numbers. Hence we know that infinitely many prime numbers have a fantastic multiple, which solves part (b).
Techniques
Quadratic residuesGreatest common divisors (gcd)Techniques: modulo, size analysis, order analysis, inequalitiesRecurrence relations