Maths Olympiad Prep

Library / /180 of 520

Number theory Difficulty 5.9 AIME, harder Find the answer

1. Determine whether the following congruences are solvable. For those that are solvable, find all solutions:
(1) x243(mod109)x^{2} \equiv 43(\bmod 109).
(2) x2247(mod881)x^{2} \equiv 247(\bmod 881).
(3) x27(mod83)x^{2} \equiv 7 \quad(\bmod 83).
(4) x211(mod59)x^{2} \equiv-11(\bmod 59).
(5) x25(mod243)x^{2} \equiv-5(\bmod 243).
(6) x246(mod121)x^{2} \equiv-46(\bmod 121).
(7) x241(mod1024)x^{2} \equiv 41(\bmod 1024).
(8) x234(mod495)x^{2} \equiv 34(\bmod 495).
(9) x281(mod729)x^{2} \equiv 81(\bmod 729).
(10) 12x211x10(mod30)12 x^{2}-11 x-1 \equiv 0(\bmod 30).
(11) x210x110(mod90)x^{2}-10 x-11 \equiv 0(\bmod 90).

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

Solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

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.