Maths Olympiad Prep

Library / /238 of 520

Number theory Difficulty 6.0 National olympiad Prove it

11. Let pp be a prime, α1\alpha \geqslant 1. Prove:
(i) For a fixed pp, all principal characters modulo pα(α1)p^{\alpha} (\alpha \geqslant 1) are the same;
(ii) For each non-principal character modulo pαp^{\alpha}, there exists a unique modulus k=pλ(1λα)k^{*}=p^{\lambda}(1 \leqslant \lambda \leqslant \alpha) and a unique primitive character modulo kk^{*} that is identical to it;
(iii) For a fixed α1\alpha \geqslant 1, for each character modulo pλ(1λα)p^{\lambda}(1 \leqslant \lambda \leqslant \alpha), there exists a unique character modulo pαp^{\alpha} that is identical to it.

Solution

11. From the expression of the feature and (iv) and (v) of question 8, we can deduce.

保留源文本的换行和格式,翻译结果如下:

11. From the expression of the feature and (iv) and (v) of question 8, we can deduce.

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.