Maths Olympiad Prep

Library / /317 of 520

Number theory Difficulty 6.2 National olympiad Prove it

19. Let p1,,prp_{1}, \cdots, p_{r} be pairwise distinct primes, m=p1k1prkrm=p_{1}^{k_{1}} \cdots p_{r}^{k_{r}}, kj(1jr)k_{j}(1 \leqslant j \leqslant r) be positive integers, and λ(m)=[φ(p1k1),,φ(prkr)]=[p1k11(p11),\lambda(m)=\left[\varphi\left(p_{1}^{k_{1}}\right), \cdots, \varphi\left(p_{r}^{k_{r}}\right)\right]=\left[p_{1}^{k_{1}-1}\left(p_{1}-1\right), \cdots\right., prkr1(pr1)]\left.p_{r}^{k_{r}-1}\left(p_{r}-1\right)\right] (see the previous problem). Prove: when (a,m)=1(a, m)=1, we have maλ(m)1m \mid a^{\lambda(m)}-1. This provides another proof of Example 5(i) in §4, and also proves the first part of Exercise 28 in §3 when (a,m)=1(a, m)=1.

Solution

19. Use problem 18 and Theorem 6.

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.