Maths Olympiad Prep

Library / /163 of 520

Number theory Difficulty 5.8 AIME, harder Find the answer

4. Find the number of solutions to the following congruence equations:
(i) x22(mod67)x^{2} \equiv -2 \pmod{67};
(ii) x22(mod67)x^{2} \equiv 2 \pmod{67};
(iii) x22(mod37)x^{2} \equiv -2 \pmod{37};
(iv) x22(mod37)x^{2} \equiv 2 \pmod{37};
(v) x21(mod221)x^{2} \equiv -1 \pmod{221};
(vi) x21(mod427)x^{2} \equiv -1 \pmod{427};
(vii) x22(mod209)x^{2} \equiv -2 \pmod{209};
(viii) x22(mod391)x^{2} \equiv 2 \pmod{391};
(ix) x24(mod45)x^{2} \equiv 4 \pmod{45};
(x) x25(mod539)x^{2} \equiv 5 \pmod{539}.

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

Solution

4. (i) 2 ; (ii) 0 ; (iii) 0 ; (iv) 0 ; (v) 221=1317,4221=13 \cdot 17, 4 solutions; (vi) 427=761427=7 \cdot 61, no solutions; (vii) 209=1119,4209=11 \cdot 19, 4 solutions; (viii) 391=1723,4391=17 \cdot 23, 4 solutions; (ix) 45=325,445=3^{2} \cdot 5, 4 solutions; (x) 539=7211,4539=7^{2} \cdot 11, 4 solutions.

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.