11. Let be a prime, . Prove:
(i) For a fixed , all principal characters modulo are the same;
(ii) For each non-principal character modulo , there exists a unique modulus and a unique primitive character modulo that is identical to it;
(iii) For a fixed , for each character modulo , there exists a unique character modulo 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.