MathDB
almost Fermat

Source: Romanian TST 1978, Day 4, P1

September 30, 2018
number theorymodular arithmetic

Problem Statement

Show that for every natural number a≥3, a\ge 3, there are infinitely many natural numbers n n such that an≡1(modn). a^n\equiv 1\pmod n . Does this hold for n=2? n=2?
Back to ProblemsView on AoPS