Problem

Source: Romanian TST 1978, Day 4, P1

Tags: number theory, modular arithmetic



Show that for every natural number $ a\ge 3, $ there are infinitely many natural numbers $ n $ such that $ a^n\equiv 1\pmod n . $ Does this hold for $ n=2? $