Number theoryDifficulty 5.9AIME, harderFind the answer
1. Determine whether the following congruences are solvable. For those that are solvable, find all solutions: (1) x2≡43(mod109). (2) x2≡247(mod881). (3) x2≡7(mod83). (4) x2≡−11(mod59). (5) x2≡−5(mod243). (6) x2≡−46(mod121). (7) x2≡41(mod1024). (8) x2≡34(mod495). (9) x2≡81(mod729). (10) 12x2−11x−1≡0(mod30). (11) x2−10x−11≡0(mod90).
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.