Maths Olympiad Prep

Library / /256 of 520

Number theory Difficulty 6.1 National olympiad Find the answer

Example 3 Solve the congruence equation x2+x+70(mod33)x^{2}+x+7 \equiv 0\left(\bmod 3^{3}\right).

A number or a short expression. Spacing and $ signs are ignored.

Solution

From the equivalent transformation III of §1\S 1, we know that the solution to this congruence equation is the same as the solution to the congruence equation
4(x2+x+7)0(mod33)4\left(x^{2}+x+7\right) \equiv 0\left(\bmod 3^{3}\right)

This congruence equation is
(2x+1)2+27(2x+1)20(mod33)(2 x+1)^{2}+27 \equiv(2 x+1)^{2} \equiv 0\left(\bmod 3^{3}\right)

It is evident that the solution to this congruence equation (referring to the value of xx) is the same as the solution to
2x+10(mod32)2 x+1 \equiv 0\left(\bmod 3^{2}\right)

Direct calculation shows that the solution is
x4(mod32)x \equiv 4\left(\bmod 3^{2}\right) \text {. }

Therefore, the solution to the original congruence equation is (why)
x5,4,13(mod33),x \equiv-5,4,13\left(\bmod 3^{3}\right),

The number of solutions is 3.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.