Maths Olympiad Prep

Library / /385 of 520

Number theory Difficulty 6.5 National olympiad Prove it

Theorem 5 For modulo 2l(l3)2^{l}(l \geqslant 3), the following 2l12^{l-1} numbers form a complete set of reduced residues: \square
(1)j05j1,0j0<2,0j1<2l2(-1)^{j_{0}} 5^{j_{1}}, \quad 0 \leqslant j_{0}<2,0 \leqslant j_{1}<2^{l-2}

In fact, for any m=2l,2g0,l3(l=3m=2^{l}, 2 \nmid g_{0}, l \geqslant 3\left(l=3\right. when, g08k1)\left.g_{0} \neq 8 k-1\right), if δm(g0)=2l2\delta_{m}\left(g_{0}\right)=2^{l-2}, then the following 2l12^{l-1} numbers form a complete set of reduced residues modulo 2l2^{l}:
(1)j0g0j1,0j0<2,0j1<2l2(-1)^{j_{0}} g_{0}^{j_{1}}, \quad 0 \leqslant j_{0}<2,0 \leqslant j_{1}<2^{l-2}

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.