Browse · MathNet
PrintFall Mathematical Competition
Bulgaria number theory
Problem
Find the least positive integer which divides for some positive integer and has the form for some integers and .
Solution
Let for some integers and and suppose that divides for some positive integer . Obviously is odd and this implies that and have different parity. Then we have . Moreover, it follows from that and therefore since .
Now and imply that or . It is obvious that is not a solution, and gives , which is also impossible. The next possibility satisfies the conditions of the problem for and . Therefore the required number is .
Now and imply that or . It is obvious that is not a solution, and gives , which is also impossible. The next possibility satisfies the conditions of the problem for and . Therefore the required number is .
Final answer
23
Techniques
Chinese remainder theoremQuadratic residuesMultiplicative orderGreatest common divisors (gcd)