Maths Olympiad Prep

Library / Romanian Mathematical Olympiad /195 of 275

Romanian Mathematical Olympiad

Number theory Difficulty 6.2 National Olympiad Prove it Romania

Determine all positive integers nn, with n≥2n \ge 2, such that the equation
x2−3⋅x+5=0 x^2 - 3 \cdot x + 5 = 0
has a unique solution in the ring (Zn,+,⋅)(\mathbb{Z}_n, +, \cdot).

Solution

We shall denote by MM the set of all positive integers nn, with n≥2n \ge 2, such that the equation (1) has a unique solution in the ring (Zn,+,⋅)(\mathbb{Z}_n, +, \cdot).
We will show that M={11}M = \{11\}.

In the ring (Z11,+,⋅)(\mathbb{Z}_{11}, +, \cdot), the equation (1) can be equivalently written as
x2−3^⋅x+5^=0^  ⟺  x2−14^⋅x+49^=0^  ⟺  (x−7^)2=0^, x^2 - \hat{3} \cdot x + \hat{5} = \hat{0} \iff x^2 - \widehat{14} \cdot x + \widehat{49} = \hat{0} \iff (x - \hat{7})^2 = \hat{0},
with the unique solution x=7^x = \hat{7}. Hence, 11∈M11 \in M.

Since k2−3k+5=(k−1)(k−2)+3k^2 - 3k + 5 = (k-1)(k-2) + 3 is an odd number for any integer k∈Zk \in \mathbb{Z}, the equation x2−3^⋅x+5^=0^x^2 - \hat{3} \cdot x + \hat{5} = \hat{0} has no solutions in the ring (Zn,+,⋅)(\mathbb{Z}_n, +, \cdot) for any even integer nn, so that M⊆2⋅N+1M \subseteq 2 \cdot \mathbb{N} + 1.

Let n∈Mn \in M be arbitrary, and x∈Znx \in \mathbb{Z}_n the unique solution of the equation (1). For the element y=3^−xy = \hat{3} - x we have then
y2−3^⋅y+5^=9^−6^⋅x+x2−3^⋅3^+3^⋅x+5^=x2−3^⋅x+5^=0^, y^2 - \hat{3} \cdot y + \hat{5} = \hat{9} - \hat{6} \cdot x + x^2 - \hat{3} \cdot \hat{3} + \hat{3} \cdot x + \hat{5} = x^2 - \hat{3} \cdot x + \hat{5} = \hat{0},
so yy is also a solution of the equation (1). Because of the uniqueness condition, we deduce that x=y=3^−xx = y = \hat{3} - x, or, equivalently, 2^⋅x=3^\hat{2} \cdot x = \hat{3}. Since nn is odd, 2^\hat{2} is invertible, and we obtain that x=3^⋅2^−1x = \hat{3} \cdot \hat{2}^{-1}.

The fact that x=3^⋅2^−1x = \hat{3} \cdot \hat{2}^{-1} is a solution of the equation can be written equivalently, considering the fact that nn 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. (\hat{3} \cdot \hat{2}^{-1})^2 - \hat{3} \cdot (\hat{3} \cdot \hat{2}^{-1}) + \hat{5} = \hat{0} \iff \hat{4} \cdot ((\hat{3} \cdot \hat{2}^{-1})^2 - \hat{3} \cdot (\hat{3} \cdot \hat{2}^{-1}) + \hat{5}) = \hat{0} \iff \\ \iff \hat{9} - \widehat{18} + \widehat{20} = \hat{0} \iff \widehat{11} = \hat{0} \iff n \mid 11.
Since n≥2n \ge 2, we conclude that n=11n = 11. Hence, M⊆{11}M \subseteq \{11\}.

Then 11∈M⊆{11}11 \in M \subseteq \{11\} implies that M={11}M = \{11\}.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.