Number theoryDifficulty 6.2National olympiadProve itRomania
Determine all positive integers n, with n≥2, such that the equation x2−3⋅x+5=0 has a unique solution in the ring (Zn,+,⋅).
Solution
We shall denote by M the set of all positive integers n, with n≥2, such that the equation (1) has a unique solution in the ring (Zn,+,⋅). We will show that M={11}.
In the ring (Z11,+,⋅), the equation (1) can be equivalently written as x2−3^⋅x+5^=0^⟺x2−14⋅x+49=0^⟺(x−7^)2=0^, with the unique solution x=7^. Hence, 11∈M.
Since k2−3k+5=(k−1)(k−2)+3 is an odd number for any integer k∈Z, the equation x2−3^⋅x+5^=0^ has no solutions in the ring (Zn,+,⋅) for any even integer n, so that M⊆2⋅N+1.
Let n∈M be arbitrary, and x∈Zn the unique solution of the equation (1). For the element y=3^−x we have then y2−3^⋅y+5^=9^−6^⋅x+x2−3^⋅3^+3^⋅x+5^=x2−3^⋅x+5^=0^, so y is also a solution of the equation (1). Because of the uniqueness condition, we deduce that x=y=3^−x, or, equivalently, 2^⋅x=3^. Since n is odd, 2^ is invertible, and we obtain that x=3^⋅2^−1.
The fact that x=3^⋅2^−1 is a solution of the equation can be written equivalently, considering the fact that n is odd, as: (3^⋅2^−1)2−3^⋅(3^⋅2^−1)+5^=0^⟺4^⋅((3^⋅2^−1)2−3^⋅(3^⋅2^−1)+5^)=0^⟺⟺9^−18+20=0^⟺11=0^⟺n∣11. Since n≥2, we conclude that n=11. Hence, M⊆{11}.
Then 11∈M⊆{11} implies that M={11}.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.