Competition problem — Number theory

Library / /359 of 520

Number theory Difficulty 6.4 National olympiad Prove it

Theorem 6 The distinct reduced residue classes modulo $m$ are
$r \bmod m, \quad(r, m)=1, \quad 1 \leqslant r \leqslant m .$
$\varphi(m)$ is equal to the number of integers in $1,2, \cdots, m$ that are relatively prime to $m$ .

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.