Browse · MathNet
PrintHellenic Mathematical Olympiad
Greece number theory
Problem
Prove that there exists integer , such that the number of the pairs of positive integers satisfying the equation is greater than 2024.
Solution
We seek solutions with , that is for some integer . Then the left part of the given equation is equal to and so we have Therefore, it is enough to select as a positive integer with more than 2024 positive integers of the form . In fact, for example, if is the sequence of primes with , then the number satisfies the problem.
---
Alternative solution.
The equation is written in the form We put , and so and the equation becomes: If , then and . Therefore it follows By putting and , the two relations take the form and . Then and . The discriminant of the last equation is . In order to integer solution, it is enough to choose for some positive integer . Then the equation has the solution . This gives , which in turn gives and . We should have (one way to achieve this is, and ). The construction now has as follows: We select a positive integer with 2024 positive integers of the form . For each one of them is determined a triad . From this triad is determined a pair satisfying the equation.
---
Alternative solution.
The equation is written in the form We put , and so and the equation becomes: If , then and . Therefore it follows By putting and , the two relations take the form and . Then and . The discriminant of the last equation is . In order to integer solution, it is enough to choose for some positive integer . Then the equation has the solution . This gives , which in turn gives and . We should have (one way to achieve this is, and ). The construction now has as follows: We select a positive integer with 2024 positive integers of the form . For each one of them is determined a triad . From this triad is determined a pair satisfying the equation.
Techniques
Diophantine EquationsGreatest common divisors (gcd)Factorization techniques