MathCastle
Number TheoryChallengeFermat, Euler and Wilson

Fermat, Euler and Wilson · Challenge problem

Find the smallest integer k>1k > 1 such that nk−nn^k - n is divisible by 2730=2⋅3⋅5⋅7⋅132730 = 2\cdot3\cdot5\cdot7\cdot13 for every integer nn.