Competition problem — Number theory

Library / /164 of 520

Number theory Difficulty 5.8 AIME, harder Prove it

30. Prove: There exist infinitely many composite numbers $n$ , such that for any integer $a$ we have
$n \mid a^{n-1}-a$

Solution

30. $n=2 p, p$ is an odd prime, all satisfy.

The text has been translated while preserving the original line breaks and format.

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.