Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia number theory
Problem
Show that there are infinitely many positive integers such that has at least two prime divisors and is divisible by .
Solution
We will construct (by induction on ) the infinite increasing sequence of odd positive integers such that any satisfies is divisible by .
We take and .
Assume we already have , that is for some positive integer which must be odd, and greater than 1 (since , it follows that ).
Take an odd prime divisor of . Substitute by and by . Then, obviously is divisible by . Furthermore, it is clear that are congruent to each other modulo , and the number of them is .
So, must be divisible by . It follows that is divisible by .
Now we take . As , and is divisible by .
Finally, it is clear that the number satisfies for any positive integer , which completes the solution.
We take and .
Assume we already have , that is for some positive integer which must be odd, and greater than 1 (since , it follows that ).
Take an odd prime divisor of . Substitute by and by . Then, obviously is divisible by . Furthermore, it is clear that are congruent to each other modulo , and the number of them is .
So, must be divisible by . It follows that is divisible by .
Now we take . As , and is divisible by .
Finally, it is clear that the number satisfies for any positive integer , which completes the solution.
Techniques
Factorization techniquesPolynomials mod p