Number TheoryChallengeFermat, Euler and Wilson ShareFermat, Euler and Wilson · Challenge problemFind the smallest integer k>1k > 1k>1 such that nk−nn^k - nnk−n is divisible by 2730=2⋅3⋅5⋅7⋅132730 = 2\cdot3\cdot5\cdot7\cdot132730=2⋅3⋅5⋅7⋅13 for every integer nnn.Check Show answer Walk through it step by step Practice more like this Review this concept